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
相关论文
共 50 条
  • [21] On a parallel machine scheduling problem with precedence constraints
    Aho, I
    Mäkinen, E
    JOURNAL OF SCHEDULING, 2006, 9 (05) : 493 - 495
  • [22] Approximation Algorithms for Scheduling with Resource and Precedence Constraints
    Demirci, Gokalp
    Hoffmann, Henry
    Kim, David H. K.
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [23] Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems
    de Oliveira, RS
    Fraga, JD
    JOURNAL OF SYSTEMS ARCHITECTURE, 2000, 46 (11) : 991 - 1004
  • [24] A monotone approximation algorithm for scheduling with precedence constraints
    Krumke, Sven O.
    Schwahn, Anne
    van Stee, Rob
    Westphal, Stephan
    OPERATIONS RESEARCH LETTERS, 2008, 36 (02) : 247 - 249
  • [25] Fault-Tolerant Scheduling for Periodic Tasks based on DVFS
    Zhu, Ping
    Yang, Fumin
    Tu, Gang
    Luo, Wei
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 2186 - 2191
  • [26] ALLOCATION AND SCHEDULING OF PRECEDENCE-RELATED PERIODIC TASKS
    RAMAMRITHAM, K
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (04) : 412 - 420
  • [27] Scheduling unit-length jobs with precedence constraints of small height
    Berger, Andre
    Grigoriev, Alexander
    Heggernes, Pinar
    van der Zwaan, Ruben
    OPERATIONS RESEARCH LETTERS, 2014, 42 (02) : 166 - 172
  • [29] APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS
    Jansen, Klaus
    Solis-Oba, Roberto
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (01) : 27 - 49
  • [30] Parallel machine scheduling with s-precedence constraints
    Kim, Eun-Seok
    Posner, Marc E.
    IIE TRANSACTIONS, 2010, 42 (07) : 525 - 537