Max–Min task scheduling algorithm for load balance in cloud computing

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

Abstract

In cloud computing, load balancing is required to distribute the dynamic local workload evenly across all the nodes. It helps to achieve a high user satisfaction and resource utilization by ensuring an efficient and fair allocation of every computing resource. Load balancing aids in minimizing resource consumption and avoids bottlenecks. Although many load balancing schemes have been presented, there is no scheme providing the elasticity in cloud computing. In this paper, a Max–Min task scheduling algorithm for load balance in the elastic cloud is proposed. To realize the load balancing, the proposed algorithm maintains a task status table to estimate the real-time load of virtual machines and the expected completion time of tasks, which can allocate the workload among nodes and realize the load balance. The extensive experiments demonstrate that the proposed Max–Min task scheduling algorithm can improve the resource utilization as well as reduce the respond time of tasks.

Cite

CITATION STYLE

APA

Mao, Y., Chen, X., & Li, X. (2014). Max–Min task scheduling algorithm for load balance in cloud computing. Advances in Intelligent Systems and Computing, 255, 457–465. https://doi.org/10.1007/978-81-322-1759-6_53

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