By Topic

Energy-efficient scheduling algorithm of task dependent graph on DVS-Unable cluster system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan Ma ; Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan, China ; Bin Gong ; Lida Zou

At present, energy-efficient scheduling algorithm in High-Performance Computing (HPC) environment is becoming a research hotspot owning to its high operation cost and low reliability. In this paper, we investigate energy-efficient scheduling algorithm of data dependent tasks in DVS-Unable cluster system. The proposed ESTD algorithm efficiently integrates task clustering with task duplication technologies to reduce data transmission time and communication energy consumption. In order to decrease the static power of processing elements, it also uses one of the power-saving techniques in system level - Dynamic Power Management on the premise that application execution is non-preemptive and predictive. ESTD algorithm not only optimizes the makespan of task dependent graph, but also confines its energy consumption into a certain extent. Compared with EAD algorithm and PEBD algorithm, experimental results and case studies demonstrate that ESTD algorithm can reduce more energy consumption while not affecting scheduling performance of applications.

Published in:

Grid Computing, 2009 10th IEEE/ACM International Conference on

Date of Conference:

13-15 Oct. 2009