Power-aware Scheduling for Multiple Feasible Interval Jobs

被引:2
|
作者
Lin, Jian [1 ]
Cheng, Albert M. K. [1 ]
机构
[1] Univ Houston, Dept Comp Sci, Houston, TX 77204 USA
来源
2009 15TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS | 2009年
关键词
D O I
10.1109/RTCSA.2009.28
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Time-critical jobs in many real-time applications have more than one feasible interval. Such jobs can be executed in any of their feasible intervals. Given a Multiple Feasible Interval (MFI) job set that is schedulable, energy can be saved by carefully selecting the executing interval for each job. In this paper, we explore the energy minimization problem for real-time systems in which jobs have multiple feasible intervals. The static and dynamic energy management schemes are both investigated to minimize the energy consumption while preserving the system's feasibility. Focusing on the EDF scheduling algorithm, we first study reducing the dynamic power consumption. We show that the static optimal speed assignment problem is NP-Hard and propose a Simulated Annealing (SA) based approach to solve it. Then, we develop an on-line greedy algorithm to exploit the run-time slacks by "fetching" the eligible job from a hot spot to execute earlier, thus, reducing the dynamic energy consumption. In addition, a leakage-aware version is discussed to improve the overall energy efficiency as well. Simulation results show that all the proposed schemes can achieve significant improvements on energy efficiency while the system remains schedulable.
引用
收藏
页码:191 / 200
页数:10
相关论文
共 50 条
  • [1] Heuristics with grouping of jobs for power-aware scheduling problems
    Rozycki, Rafal
    Zimniak, Arkadiusz
    2015 20TH INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN AUTOMATION AND ROBOTICS (MMAR), 2015, : 47 - 51
  • [2] Approximation algorithms for scheduling multiple feasible interval jobs
    Chen, JJ
    Wu, J
    Shih, CS
    Kuo, TW
    11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 11 - 16
  • [3] Energy reduction for scheduling a set of multiple feasible interval jobs
    Lin, Jian
    Cheng, Albert M. K.
    JOURNAL OF SYSTEMS ARCHITECTURE, 2011, 57 (06) : 663 - 673
  • [4] Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
    Rozycki, R.
    Weglarz, J.
    ANNALS OF OPERATIONS RESEARCH, 2014, 213 (01) : 235 - 252
  • [5] Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
    Rozycki, Rafal
    Weglarz, Jan
    DISCRETE APPLIED MATHEMATICS, 2015, 182 : 150 - 161
  • [6] Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
    Rozycki, R.
    Weglarz, J.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) : 68 - 75
  • [7] Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
    R. Różycki
    J. Węglarz
    Annals of Operations Research, 2014, 213 : 235 - 252
  • [8] Power-aware instruction scheduling
    Lin, Tzong-Yen
    Chang, Rong-Guey
    EMBEDDED AND UBIQUITOUS COMPUTING, PROCEEDINGS, 2006, 4096 : 35 - 44
  • [9] Scheduling jobs with multiple feasible intervals
    Shih, CS
    Liu, JWS
    Cheong, IK
    REAL-TIME AND EMBEDDED COMPUTING SYSTEMS AND APPLICATIONS, 2003, 2968 : 53 - 71
  • [10] Power-Aware Scheduling of Preemptable Independent Jobs on a Single Processor to Meet a Schedule Deadline
    Rozycki, Rafal
    Waligora, Grzegorz
    2018 23RD INTERNATIONAL CONFERENCE ON METHODS & MODELS IN AUTOMATION & ROBOTICS (MMAR), 2018, : 943 - 946