Energy efficient scheduling of real-time tasks on multicore processors
Cited 37 times inCited 61 times in
- Energy efficient scheduling of real-time tasks on multicore processors
- Seo, Euiseong; Jeong, Jinkyu; Park, Seonyeong; Lee, Joonwon
- Low-power design; Multicore processors; Multiprocessor systems; Power-aware systems; Real-time scheduling; Real-time systems
- Issue Date
- IEEE COMPUTER SOC
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.19, no.11, pp.1540 - 1552
- Multicore processors deliver a higher throughput at lower power consumption than unicore processors. 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 that 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 percent even with the best energy-efficient partitioning algorithm. The results also show that Dynamic Core Scaling can reduce energy consumption by about 26 percent under low load conditions.
- ; Go to Link
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.