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 条
  • [31] Makespan Minimization for Scheduling on Heterogeneous Platforms with Precedence Constraints
    Fagnon, Vincent
    Lucarelli, Giorgio
    Rapine, Christophe
    EURO-PAR 2024: PARALLEL PROCESSING, PT I, EURO-PAR 2024, 2024, 14801 : 343 - 356
  • [32] Approximation algorithms for scheduling jobs with chain precedence constraints
    Jansen, K
    Solis-Oba, R
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 105 - 112
  • [33] Multiprocessor scheduling under precedence constraints: Polyhedral results
    Coll, PE
    Ribeiro, CC
    de Souza, CC
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (05) : 770 - 801
  • [34] On the Approximability of Single-Machine Scheduling with Precedence Constraints
    Ambuehl, Christoph
    Mastrolilli, Monaldo
    Mutsanas, Nikolaus
    Svensson, Ola
    MATHEMATICS OF OPERATIONS RESEARCH, 2011, 36 (04) : 653 - 669
  • [35] Scheduling jobs with chain precedence constraints and deteriorating jobs
    Wang, J-B
    Wang, J-J
    Ji, P.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (09) : 1765 - 1770
  • [36] Scheduling Precedence Constrained Tasks for Mobile Applications in Fog Computing
    Li, Keqin
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2023, 16 (03) : 2153 - 2164
  • [37] Scheduling Precedence Constrained Stochastic Tasks on Heterogeneous Cluster Systems
    Li, Kenli
    Tang, Xiaoyong
    Veeravalli, Bharadwaj
    Li, Keqin
    IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (01) : 191 - 204
  • [38] SCHEDULING OF PRECEDENCE-CONSTRAINED PARALLEL PROGRAM TASKS ON MULTIPROCESSORS
    MURTHY, CSR
    MURTHY, KNB
    SREENIVAS, A
    MICROPROCESSING AND MICROPROGRAMMING, 1993, 36 (02): : 93 - 104
  • [39] Scheduling multiprocessor tasks with chain constraints
    Blazewicz, J
    Liu, Z
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 231 - 241
  • [40] Handling precedence constraints in scheduling problems by the sequence pair representation
    Kozik, Andrzej
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 445 - 472