Energy Efficient Scheduling of Real-Time Tasks on Multicore Processors

  • Authors:

  • Euiseong Seo;Jinkyu Jeong;Seonyeong Park;Joonwon Lee

  • Affiliations:

  • Penn State University, University Park, PA;Korea Advanced Institute of Science and Technology, Daejeon;Korea Advanced Institute of Science and Technology, Daejeon;Korea Advanced Institute of Science and Technology, Daejeon

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multicore processors deliver a higher throughput at lower power consumption than unicore pro- cessors. In the near future, they will thus be widely used in mobile real-time systems. There have been many research on energy-efficient scheduling of real-time tasks using DVS. These approaches must be modified for multicore processors, however, since normally all the cores in a chip must run at the same performance level. Thus blindly adopting existing DVS algorithms which do not consider the restriction will result in a waste of energy. This article suggests Dynamic Repartitioning algorithm based on existing partitioning approaches of multiprocessor systems. The algorithm dynamically balances the task loads of multiple cores to optimize power consumption during execution. We also suggest Dynamic Core Scaling algorithm which adjusts the number of active cores to reduce leakage power consumption under low load conditions. Simulation results show that Dynamic Repartitioning can produce energy savings of about 8% even with the best energy-efficient partitioning algorithm. The results also show that Dynamic Core Scaling can reduce energy consumption by about 26% under low load conditions.