Energy-Aware Real-Time Task Scheduling on Local/Shared Memory Systems

Author(s):  
Chenchen Fu ◽  
Gruia Calinescu ◽  
Kai Wang ◽  
Minming Li ◽  
Chun Jason Xue
2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Weizhe Zhang ◽  
Hucheng Xie ◽  
Boran Cao ◽  
Albert M. K. Cheng

Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO) based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.


2005 ◽  
Author(s):  
Vishnu Swaminathan ◽  
Krishnendu Chakrabarty

2020 ◽  
Vol 28 ◽  
pp. 100413
Author(s):  
Mahmoud Hasanloo ◽  
Mehdi Kargahi ◽  
Shahrokh Jalilian

2001 ◽  
Vol 338 (6) ◽  
pp. 729-750 ◽  
Author(s):  
Vishnu Swaminathan ◽  
Krishnendu Chakrabarty

Electronics ◽  
2017 ◽  
Vol 6 (2) ◽  
pp. 40 ◽  
Author(s):  
Amjad Mahmood ◽  
Salman Khan ◽  
Fawzi Albalooshi ◽  
Noor Awwad

2010 ◽  
Vol E93-D (5) ◽  
pp. 1147-1153 ◽  
Author(s):  
Yong-Hee KIM ◽  
Myoung-Jo JUNG ◽  
Cheol-Hoon LEE

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-25
Author(s):  
Shounak Chakraborty ◽  
Sangeet Saha ◽  
Magnus Själander ◽  
Klaus Mcdonald-Maier

Achieving high result-accuracy in approximate computing (AC) based real-time applications without violating power constraints of the underlying hardware is a challenging problem. Execution of such AC real-time tasks can be divided into the execution of the mandatory part to obtain a result of acceptable quality, followed by a partial/complete execution of the optional part to improve accuracy of the initially obtained result within the given time-limit. However, enhancing result-accuracy at the cost of increased execution length might lead to deadline violations with higher energy usage. We propose Prepare , a novel hybrid offline-online approximate real-time task-scheduling approach, that first schedules AC-based tasks and determines operational processing speeds for each individual task constrained by system-wide power limit, deadline, and task-dependency. At runtime, by employing fine-grained DVFS, the energy-adaptive processing speed governing mechanism of Prepare reduces processing speed during each last level cache miss induced stall and scales up the processing speed once the stall finishes to a higher value than the predetermined one. To ensure on-chip thermal safety, this higher processing speed is maintained only for a short time-span after each stall, however, this reduces execution times of the individual task and generates slacks. Prepare exploits the slacks either to enhance result-accuracy of the tasks, or to improve thermal and energy efficiency of the underlying hardware, or both. With a 70 - 80% workload, Prepare offers 75% result-accuracy with its constrained scheduling, which is enhanced by 5.3% for our benchmark based evaluation of the online energy-adaptive mechanism on a 4-core based homogeneous chip multi-processor, while meeting the deadline constraint. Overall, while maintaining runtime thermal safety, Prepare reduces peak temperature by up to 8.6 °C for our baseline system. Our empirical evaluation shows that constrained scheduling of Prepare outperforms a state-of-the-art scheduling policy, whereas our runtime energy-adaptive mechanism surpasses two current DVFS based thermal management techniques.


Sign in / Sign up

Export Citation Format

Share Document