On the Interplay between Global DVFS and Scheduling Tasks with Precedence Constraints

被引:45
作者
Gerards, Marco E. T. [1 ]
Hurink, Johann L. [1 ]
Kuper, Jan [1 ]
机构
[1] Univ Twente, Dept EEMCS, NL-7500 AE Enschede, Netherlands
关键词
Convex programming; energy aware-systems; global optimization; heuristic methods; multi-core/single-chip multiprocessors; scheduling; DYNAMIC VOLTAGE; ENERGY; ALGORITHM; SET;
D O I
10.1109/TC.2014.2345410
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Many multicore processors are capable of decreasing the voltage and clock frequency to save energy at the cost of an increased delay. While a large part of the theory oriented literature focuses on local dynamic voltage and frequency scaling (local DVFS), where every core's voltage and clock frequency can be set separately, this article presents an in-depth theoretical study of the more commonly available global DVFS that makes such changes for the entire chip. This article shows how to choose the optimal clock frequencies that minimize the energy for global DVFS, and it discusses the relationship between scheduling and optimal global DVFS. Formulas are given to find this optimum under time constraints, including proofs thereof. The problem of simultaneously choosing clock frequencies and a schedule that together minimize the energy consumption is discussed, and based on this a scheduling criterion is derived that implicitly assigns frequencies and minimizes energy consumption. Furthermore, this article studies the effectivity of a large class of scheduling algorithms with regard to the derived criterion, and a bound on the maximal relative deviation is given. Simulations show that with our techniques an energy reduction of 30% can be achieved with respect to state-of-the-art research.
引用
收藏
页码:1742 / 1754
页数:13
相关论文
共 40 条
[31]  
Pruhs K, 2006, LECT NOTES COMPUT SC, V3879, P307
[32]   Green Computing Algorithmics [J].
Pruhs, Kirk .
2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, :3-4
[33]  
Roundtree B., P 2007 ACMIEEE C SUP, DOI DOI 10.1145/1362622.1362688
[34]   A standard task graph set for fair evaluation of multiprocessor scheduling algorithms [J].
Tobita, T ;
Kasahara, H .
JOURNAL OF SCHEDULING, 2002, 5 (05) :379-394
[35]  
Weiser M., 1996, MOBILE COMPUTING, P449, DOI DOI 10.1007/978-0-585-29603-617
[36]  
Yang CY, 2005, DES AUT TEST EUROPE, P468
[37]  
Yao F, 1995, AN S FDN CO, P374, DOI 10.1109/SFCS.1995.492493
[38]   TL-Plane-Based Multi-Core Energy-Efficient Real-Time Scheduling Algorithm for Sporadic Tasks [J].
Zhang, Dongsong ;
Guo, Deke ;
Chen, Fangyuan ;
Wu, Fei ;
Wu, Tong ;
Cao, Ting ;
Jin, Shiyao .
ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2012, 8 (04)
[39]   Scheduling with dynamic voltage/speed adjustment using slack reclamation in multiprocessor real-time systems [J].
Zhu, DK ;
Melhem, R ;
Childers, BR .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (07) :686-700
[40]   Survey of Energy-Cognizant Scheduling Techniques [J].
Zhuravlev, Sergey ;
Carlos Saez, Juan ;
Blagodurov, Sergey ;
Fedorova, Alexandra ;
Prieto, Manuel .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (07) :1447-1464