User-priority guided Min-Min scheduling algorithm for load balancing in cloud computing

HuanKai Chen, Frank Wang, Na Helian, Gbola Akanmu

Research output: Contribution to conferencePaperpeer-review

Abstract

Cloud computing is emerging as a new paradigm of large-scale distributed computing. In order to utilize the power of cloud computing completely, we need an efficient task scheduling algorithm. The traditional Min-Min algorithm is a simple, efficient algorithm that produces a better schedule that minimizes the total completion time of tasks than other algorithms in the literature [7]. However the biggest drawback of it is load imbalanced, which is one of the central issues for cloud providers. In this paper, an improved load balanced algorithm is introduced on the ground of Min-Min algorithm in order to reduce the makespan and increase the resource utilization (LBIMM). At the same time, Cloud providers offer computer resources to users on a pay-per-use base. In order to accommodate the demands of different users, they may offer different levels of quality for services. Then the cost per resource unit depends on the …
Original languageEnglish
Pages1-8
Publication statusPublished - 21 Feb 2013
Event2013 National Conference on Parallel computing technologies (PARCOMPTECH) -
Duration: 21 Feb 201323 Feb 2013
https://ieeexplore.ieee.org/xpl/conhome/6599410/proceeding

Conference

Conference2013 National Conference on Parallel computing technologies (PARCOMPTECH)
Period21/02/1323/02/13
Internet address

Fingerprint

Dive into the research topics of 'User-priority guided Min-Min scheduling algorithm for load balancing in cloud computing'. Together they form a unique fingerprint.

Cite this