Open Access Open Access  Restricted Access Subscription or Fee Access

An Effective Resource Utilization by using MEASY Algorithm in Cloud

B. Parkavi, G. Malathy

Abstract


In large scale super computing environment, parallel machines have traditionally used space-sharing strategies to accommodate multiple jobs at the same time by dedicating the nodes to a single job until it completes. This results in starvation of larger jobs, reduced throughput and underutilization of resources. Existing scheduling schemes make use of backfilling strategies which preempt shortest jobs to execute when jobs at head of the queue have unavailable of resources. In this paper, MEASY algorithm is proposed which adopts migration and consolidation to enhance the most popular EASY scheduling algorithm. It outperforms quality of service and increase resource utilization by providing improvement on the average response time.

Keywords


Cloud Computing, Backfill, EASY, Parallel Job Scheduling.

Full Text:

PDF

References


U. Schwiegelshohn and R. Yahyapour, “Analysis of first-come-first-serve parallel job scheduling,” in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 629–638, Society for Industrial and Applied Mathematics, New York, NY, USA, 1998.

Amazon, “High performance computing _HPC_ on AWS,” 2011, http://aws.amazon.com/hpc-application.

A.W. Mu’alem and. Feitelson, “Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling,” IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 6, pp. 529–543, 2001.

Y. Zhang, H. Franke, J. Moreira, and A. Sivasubramaniam, “An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 236–247, 2003.

D. Feitelson and M. Jettee, “Improved utilization and responsiveness with gang scheduling,” in Job Scheduling Strategies for Parallel Processing, pp. 238–261, Springer, 1997.

D. Tsafrir, Y. Etsion, and D. Feitelson, “Backfilling Using System- Generated Predictions Rather than User Runtime Estimates,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 789-803, June 2007.

X. C. Liu, C. Wang, X. G. Qiu, B. B. Zhou, B. Chen, and A. Y. Zomaya, “Backfilling under two-tier virtual machines,” in Proceedings of the International Conference on Cluster Computing (Cluster ’12), IEEE, 2012.

A. Malik, A. Park, and R. Fujimoto, “Optimistic Synchronization of Parallel Simulations in Cloud Computing Environments,” Proc. IEEE Int’l Conf. Cloud Computing (CLOUD ’09), pp. 49-56, 2009.

R. Fujimoto, A. Malik, and A. Park, “Parallel and Distributed Simulation in the Cloud,” Int’l Simulation Magazine, Soc. for Modeling and Simulation, vol. 1, no. 3, 2010.

G. D’Angelo, “Parallel and Distributed Simulation from Many Cores to the Public Cloud,” Proc. Int’l Conf. High Performance Computing and Simulation (HPCS), pp. 14-23, 2011.

D. Jackson, Q. Snell, and M. Clement, “Core Algorithms of the Maui Scheduler,” Proc. Workshop Job Scheduling Strategies for Parallel Processing, pp. 87-102, 2001.

Y. Wiseman and D. Feitelson, “Paired Gang Scheduling,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 6, pp. 581-592, June 2003.

A. Do, J. Chen, C. Wang, Y. Lee, A. Zomaya, and B. Zhou, “Profiling Applications for Virtual Machine Placement in Clouds,” Proc. IEEE Int’l Conf. Cloud Computing (CLOUD), pp. 660-667, and 2011.

J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riordan, “Modeling of Workload in Mpps,” Proc. Workshop Job Scheduling Strategies for Parallel Processing, pp. 95-116, 1997.

D. Feitelson, L. Rudolph, U. Schwiegelshohn, K. Sevcik, and P.Wong, “Theory and Practice in Parallel Job Scheduling,” Proc.Workshop Job Scheduling Strategies for Parallel Processing, pp. 1-34, 1997.

D. Feitelson, “Packing Schemes for Gang Scheduling,” Proc.Workshop Job Scheduling Strategies for Parallel Processing, pp.89-110, 1996


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.