Minimum makespan task scheduling algorithm in cloud computing

8Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

Cloud computing provides powerful and on-demand business environment. It is built on top of virtualized data centers. Virtualization provides the flexible infrastructure for cloud. But, managing the resources and scheduling the tasks in virtualized data center is a challenging task. This paper proposes a minimum makespan task scheduling framework named MMSF and minimum makespan task scheduling algorithm named as MMA. This algorithm is developed with two objectives. First, minimizing the total makespan and maximizing the virtual machine utilization. The task scheduling problem is formulated as multi-objective optimization problem. It is solved by using optimization techniques. Experiments shows that MMA outperforms the traditional task scheduling algorithms based on total makespan and virtual machine utilization.

Cite

CITATION STYLE

APA

Sasikaladevi, N. (2016). Minimum makespan task scheduling algorithm in cloud computing. International Journal of Grid and Distributed Computing, 9(11), 61–70. https://doi.org/10.14257/ijgdc.2016.9.11.05

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