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 条
  • [21] A Power-Efficient Distributed TDMA Scheduling Algorithm with Distance-Measurement for Wireless Sensor Networks
    Sato, Koji
    Sakata, Shiro
    WIRELESS PERSONAL COMMUNICATIONS, 2014, 75 (02) : 1511 - 1528
  • [22] Gang scheduling for highly efficient distributed multiprocessor systems
    Franke, B
    Pattnaik, P
    Rudolph, L
    FRONTIERS '96 - THE SIXTH SYMPOSIUM ON FRONTIERS OF MASSIVELY PARALLEL COMPUTING, PROCEEDINGS, 1996, : 4 - 12
  • [23] EFFICIENT DYNAMIC JOB SCHEDULING ALGORITHMS FOR MULTIPROCESSOR SYSTEMS
    MAHESH, S
    MURTHY, CSR
    RANGAN, CP
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (01) : 3 - 12
  • [24] The Carousel-EDF Scheduling Algorithm for Multiprocessor Systems
    Sousa, Paulo Baltarejo
    Souto, Pedro
    Tovar, Eduardo
    Bletsas, Konstantinos
    2013 IEEE 19TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA), 2013, : 12 - 21
  • [25] Online Randomized Multiprocessor Scheduling
    S. S. Seiden
    Algorithmica, 2000, 28 : 173 - 216
  • [26] Online randomized multiprocessor scheduling
    Seiden, SS
    ALGORITHMICA, 2000, 28 (02) : 173 - 216
  • [27] An approximation algorithm for energy-efficient scheduling on a chip multiprocessor
    Yang, CY
    Chen, JJ
    Kuo, TW
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2005, : 468 - 473
  • [28] An Efficient Algorithm for Load Balancing in Multiprocessor Systems
    Khawatreh, Saleh A.
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2018, 9 (03) : 160 - 164
  • [30] Energy-efficient tasks scheduling algorithm for real-time multiprocessor embedded systems
    Wang, Hwang-Cheng
    Woungang, Isaac
    Yao, Cheng-Wen
    Anpalagan, Alagan
    Obaidat, Mohammad S.
    JOURNAL OF SUPERCOMPUTING, 2012, 62 (02): : 967 - 988