Multiprocessor Energy-Efficient Scheduling with Task Migration Considerations

  • Authors:
  • Jian-Jia Chen;Heng-Ruey Hsu;Kai-Hsiang Chuang;Chia-Lin Yang;Ai-Chun Pang;Tei-Wei Kuo

  • Affiliations:
  • National Taiwan University;National Taiwan University;National Taiwan University;National Taiwan University;National Taiwan University;National Taiwan University

  • Venue:
  • ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper targets energy-efficient scheduling oftasks over multiple processors, where tasks share a commondeadline. Distinct from many research results onheuristics-based energy-efficient scheduling, we proposeapproximation algorithms with different approximationbounds for processors with/without constraintson the maximum processor speed, where no task migrationis allowed. When there is no constraint onprocessor speeds, we propose an approximation algorithmfor two-processor scheduling to provide trade-offsamong the specified error, the running time, the approximationratio, and the memory space complexity. Anapproximation algorithm with a 1.13-approximation ratiofor M-processor systems is also derived (M 2).When there is an upper bound on processor speeds, anartificial-bound approach is taken to minimize the energyconsumption with a 1.13-approximation ratio. Anoptimal scheduling algorithm is then proposed in the minimizationof the energy consumption when task migrationis allowed.