Energy-efficient task scheduling and consolidation algorithm for workflow jobs in cloud
by Mustafa Khaleel; Michelle M. Zhu
International Journal of Computational Science and Engineering (IJCSE), Vol. 13, No. 3, 2016

Abstract: The energy consumption of underlying cloud hardware has dramatically increased. The cloud service providers need to adopt some cost-effective and energy-aware job scheduler without compromising the quality of service (QoS) specified in the service level agreement (SLA). Based on a rigorous mathematical model, we formulate an energy efficient problem to improve the resource utilisation for high system throughput. A multiple-procedure heuristic workflow scheduling and consolidation strategy is proposed with objectives to maximise the resource utilisation and minimise the power. Several techniques have been utilised including dynamic voltage and frequency scaling (DVFS) with task module migration for workload balance and task consolidation for virtual machine (VM) overhead reduction. The simulation results illustrate that our approach consistently achieves a lower power consumption and higher resource utilisation rate within the execution time bound compared with other similar scheduling algorithms as well as our previous algorithm without the task migration based on VM threshold.

Online publication date: Tue, 06-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com