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

被引:44
|
作者
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
相关论文
共 50 条
  • [21] Scheduling Moldable Tasks with Precedence Constraints and Arbitrary Speedup Functions on Multiprocessors
    Hunold, Sascha
    PARALLEL PROCESSING AND APPLIED MATHEMATICS (PPAM 2013), PT II, 2014, 8385 : 13 - 25
  • [22] Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
    Guenther, Elisabeth
    Koenig, Felix G.
    Megow, Nicole
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 164 - 181
  • [23] An approximation algorithm for scheduling malleable tasks under general precedence constraints
    Jansen, K
    Zhang, H
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 236 - 245
  • [24] SEQUENCING TASKS WITH PRECEDENCE CONSTRAINTS
    PARSONS, JA
    JOURNAL OF SYSTEMS MANAGEMENT, 1970, 21 (05): : 36 - 38
  • [25] Scheduling Precedence Constraints among Charging Tasks in Wireless Rechargeable Sensor Networks
    Li, Lanlan
    Dai, Haipeng
    Chen, Chen
    Ni, Zilu
    Li, Shihao
    ELECTRONICS, 2024, 13 (02)
  • [27] A 3.42-Approximation Algorithm for Scheduling Malleable Tasks under Precedence Constraints
    Chen, Chi-Yeh
    Chu, Chih-Ping
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (08) : 1479 - 1488
  • [28] Layer-Based Scheduling Algorithms for Multiprocessor-Tasks with Precedence Constraints
    Duemmler, Joerg
    Kunis, Raphael
    Ruenger, Gudula
    PARALLEL COMPUTING: ARCHITECTURES, ALGORITHMS AND APPLICATIONS, 2008, 15 : 321 - +
  • [29] Dynamic scheduling algorithm for hybrid real-time tasks with precedence constraints
    Yin, Jin-Yong
    Gu, Guo-Chang
    Zhao, Jing
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2010, 16 (02): : 411 - 416
  • [30] STABILITY CONDITION OF A SERVICE SYSTEM WITH PRECEDENCE CONSTRAINTS BETWEEN TASKS
    VINCENT, JM
    PERFORMANCE EVALUATION, 1991, 12 (01) : 61 - 66