A novel power-conscious scheduling algorithm for data-intensive precedence-constrained applications in cloud environments
by Peng Xiao; Ning Han
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 7, No. 4, 2014

Abstract: With the development of cloud computing, energy-efficient management and control have become a major concern in the virtualisation data centres. Although many energy-conserving policies and technologies have been proposed, most of them are categorised as device/system-oriented, which mainly concentrate on low-level energy consumption optimisation. In this paper, we propose a novel application-oriented heuristic algorithm, which has the effect of saving the data-accessing energy consumption for data-intensive workflows in virtualised cloud platforms. In the proposed algorithm, a novel heuristic metric called minimal data-accessing energy path is introduced with the aim of reducing the energy consumption of intensive data-accessing. Extensive experiments are conducted to examine the effectiveness and performance of the proposed scheduling algorithm. The experimental results show that the proposed heuristic scheduling can significantly reduce the energy consumption of storing/retrieving intermediate data generated during the execution of data-intensive workflow.

Online publication date: Tue, 29-Jul-2014

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 High Performance Computing and Networking (IJHPCN):
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