Paper Info
Title
Energy Aware Scheduling For Precedence Constrained Parallel Tasks In A Power-Scalable Cluster
Abstract
Improving the energy efficiency of high performance clusters has become important research issue. We proposed a new algorithm that reduces energy consumption of precedence constrained parallel tasks in power-scalable clusters. To reduce energy consumption without increasing the schedule length, our algorithm reclaims both static and dynamic slack time and employs different frequency adjusting techniques in different slack time. The optimal frequency is obtained through analyzing the precedence constraints of parallel tasks. We conducted experiments to compare the proposed algorithm with two other existing algorithms. Simulation results show that the proposed algorithm can get better energy efficiency without increasing the makespan.
Year
DOI
Venue
2013
10.1109/HPCC.and.EUC.2013.144
2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC)
Keywords
Field
DocType
energy aware, cluster, makespan, DVFS, DAG
Fair-share scheduling,Efficient energy use,Scheduling (computing),Computer science,Real-time computing,Least slack time scheduling,Cluster analysis,Dynamic priority scheduling,Energy consumption,Distributed computing,Scalability
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Aihua Liang1123.03
Limin Xiao223147.05
Yongnan Li3268.35
Zhenzhong Zhang400.68
Li Ruan512325.10