A novel approach for balancing the loads on virtual machines for scheduling parallel jobs based on priority-based consolidation method

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud computing is an emerging computing technology that uses the internet and central server to maintain data and application. In computing, load balancing distributes workloads across multiple computing resources. Scheduling of parallel jobs is an important issue in the cloud data centers. Node number requirement of each parallel job is different in case of complex applications. A load balancing algorithm attempts to improve the response time of user-submitted applications by ensuring maximal utilization of available resources. The main contribution of the work is to analyze different scheduling algorithms and to reduce the migration cost, waiting time, makespan, and response time. So the proposed work introduced a new algorithm and compared makespan, waiting time, response time, number of migrations, and idle time of different algorithms such as FCFS, backfill, CMCBF, AMCBF. The number of migrations required in the proposed algorithm is less compared to that of other algorithms.

Cite

CITATION STYLE

APA

Shameem, P. M., Shaji, R. S., & Vijayan, J. (2016). A novel approach for balancing the loads on virtual machines for scheduling parallel jobs based on priority-based consolidation method. In Advances in Intelligent Systems and Computing (Vol. 397, pp. 837–880). Springer Verlag. https://doi.org/10.1007/978-81-322-2671-0_82

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free