LBMM: A load balancing based task scheduling algorithm for cloud

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

Abstract

As one of the fields in Computer Science research, Cloud Computing has attracted attentions from industries as well as academia in recent years. Numerous topics have been studied related to Cloud Computing, and one of them is task scheduling. Task scheduling is the strategy to assigning various tasks to certain resources. Existing task scheduling algorithms include Min-Min, Suffrage, Max-Min and many more, in which Max-Min is efficient in minimizing the completion time of tasks and producing a good task schedule, however, it has a drawback of load unbalancing. To address this issue, we design an algorithm called LBMM for task scheduling considering load balancing as the key concept. We conduct our experiments using CloudSim package which is a framework for simulating activities in the Cloud systems. The experimental results demonstrate that our algorithm decreases the completion time and improves load balancing of resources, and it outperforms the traditional Max-Min and Min-Min.

Cite

CITATION STYLE

APA

Shi, Y., & Qian, K. (2020). LBMM: A load balancing based task scheduling algorithm for cloud. In Lecture Notes in Networks and Systems (Vol. 70, pp. 706–712). Springer. https://doi.org/10.1007/978-3-030-12385-7_50

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