An online power-efficient scheduling algorithm for multiprocessor systems

被引:0
|
作者
Cao, Yangjie [1 ]
Qian, Depei [1 ,2 ]
Wu, Weiguo [1 ]
Dong, Xiaoshe [1 ]
机构
[1] School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an 710049, China
[2] Department of Computer Science and Technology, Beihang University, Beijing 100191, China
关键词
Decision making - Electric power utilization - Fault tolerance - Multiprocessing systems - Online systems - Speed;
D O I
暂无
中图分类号
学科分类号
摘要
Aiming at addressing the bottleneck problem of heat dissipation in multiprocessor systems, an online power-efficient scheduling algorithm PEQUI is proposed based on the dynamic speed scaling technique. PEQUI is capable of fairly allocating processor resources by applying the dynamic partitioning strategy (EQUI). Moreover, PEQUI adjusts processor speeds in proportion to the number of active jobs by taking the non-linear relationship between processor's power consumption and its execution speed into account. Compared with traditional power-efficient algorithms, PEQUI is able to make irrevocable decisions by using only information of the current active jobs, and needs fewer decision-making parameters. Online competitive analysis and a comparison with the optimal offline algorithm show that PEQUI achieves a constant competitive ratio with respect to the total execution time and energy. Simulation results show that PEQUI achieves better performance and lower power consumption than algorithms such as the latest arrival processor sharing (LAPS) and EQUI-based strategies with constant speed. A comparison with LAPS under the same workloads shows that PEQUI effectively reduces power consumption while the execution time reduces near 7%.
引用
收藏
页码:15 / 19
相关论文
共 50 条
  • [1] An Efficient Scheduling Algorithm for the Multiprocessor Platform
    Andrei, Stefan
    Cheng, Albert M. K.
    Grigoras, Gheorghe
    Radulescu, Vlad
    12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010), 2011, : 245 - 252
  • [2] Efficient dynamic scheduling algorithm for multiprocessor real-time systems
    Indian Inst of Technology, Madras, India
    IEEE Trans Parallel Distrib Syst, 3 (312-319):
  • [3] An efficient dynamic scheduling algorithm for multiprocessor real-time systems
    Manimaran, G
    Murthy, CSR
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (03) : 312 - 319
  • [4] An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
    Kellerer, Hans
    Kotov, Vladimir
    Gabay, Michael
    JOURNAL OF SCHEDULING, 2015, 18 (06) : 623 - 630
  • [5] NEARLY ONLINE SCHEDULING OF MULTIPROCESSOR SYSTEMS WITH MEMORIES
    LAI, TH
    SAHNI, S
    JOURNAL OF ALGORITHMS, 1983, 4 (04) : 353 - 362
  • [6] An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
    Hans Kellerer
    Vladimir Kotov
    Michaël Gabay
    Journal of Scheduling, 2015, 18 : 623 - 630
  • [7] Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection
    Nemeth, Tamas
    Imreh, Csanad
    ACTA CYBERNETICA, 2009, 19 (01): : 125 - 133
  • [8] Power-Efficient Instancy Aware DRAM Scheduling
    Pan, Gung-Yu
    Lai, Chih-Yen
    Jou, Jing-Yang
    Lai, Bo-Cheng Charles
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (04) : 942 - 953
  • [9] Power-efficient scheduling method in sensor networks
    Lu, HF
    Chang, YC
    Hu, HH
    Chen, JL
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 4705 - 4710
  • [10] Power Efficient Scheduling for Hard Real-Time Systems on a Multiprocessor Platform
    Nistler, Peter J.
    Gaudiot, Jean-Luc
    NETWORK AND PARALLEL COMPUTING, 2010, 6289 : 106 - 120