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 条
  • [41] Complexity of scheduling of coupled tasks with chains precedence constraints and any constant length of gap
    Ecker, K.
    Tanas, M.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (04) : 524 - 529
  • [42] Probabilistic performance analysis of scheduling parallel tasks with precedence constraints on mesh connected multicomputers
    Li, KQ
    CONFERENCE PROCEEDINGS OF THE 1996 IEEE FIFTEENTH ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS, 1996, : 358 - 365
  • [43] THE PARALLEL COMPLEXITY OF SCHEDULING WITH PRECEDENCE CONSTRAINTS
    DOLEV, D
    UPFAL, E
    WARMUTH, MK
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1986, 3 (04) : 553 - 576
  • [44] COMPLEXITY OF SCHEDULING UNDER PRECEDENCE CONSTRAINTS
    LENSTRA, JK
    RINNOOYKAN, AHG
    OPERATIONS RESEARCH, 1978, 26 (01) : 22 - 35
  • [45] Stochastic machine scheduling with precedence constraints
    Skutella, M
    Uetz, M
    SIAM JOURNAL ON COMPUTING, 2005, 34 (04) : 788 - 802
  • [46] Machine scheduling with soft precedence constraints
    Zhang, An
    Qi, Xiangtong
    Li, Guanhua
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (02) : 491 - 505
  • [47] On-line scheduling with precedence constraints
    Azar, Y
    Epstein, L
    ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 164 - 174
  • [48] Heterogeneous vehicle scheduling with precedence constraints
    Zhang, Ruiyou
    Liu, Zhujun
    Moon, Ilkyeong
    TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2024,
  • [49] On-line scheduling with precedence constraints
    Azar, Y
    Epstein, L
    DISCRETE APPLIED MATHEMATICS, 2002, 119 (1-2) : 169 - 180
  • [50] Uniprocessor Scheduling Under Precedence Constraints
    Mangeruca, L.
    Baleani, M.
    Ferrari, A.
    Sangiovanni-Vincentelli, A. L.
    PROCEEDINGS OF THE 12TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, 2006, : 157 - +