Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems

Authors:
Dakai Zhu;Nevine AbouGhazaleh;Daniel Mossé;Rami Melhem
Affiliations:
-;-;-;-
Venue:
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Year:
2002

Citing 0
Cited 7

Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems

ACM Transactions on Embedded Computing Systems (TECS)
An energy-aware gradient-based scheduling heuristic for heterogeneous multiprocessor embedded systems

HiPC'07 Proceedings of the 14th international conference on High performance computing
An energy-balanced task scheduling heuristic for heterogeneous wireless sensor networks

HiPC'08 Proceedings of the 15th international conference on High performance computing
Assigning real-time tasks to heterogeneous processors by applying ant colony optimization

Journal of Parallel and Distributed Computing
Hybrid power management in real time embedded systems: an interplay of DVFS and DPM techniques

Real-Time Systems
An experimental comparison of different real-time schedulers on multicore systems

Journal of Systems and Software
On two-pronged power-aware voltage scheduling for multi-processor real-time systems

PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previously proposed two greedy slack sharing scheduling algorithms for such applications on multi-processor systems. In this paper, we are concerned mainly with real-time applications that have different execution paths consisting of different number of tasks. The AND/OR graph model is used to represent the application's data dependence and control flow. The contribution of this paper is twofold. First, we extend our greedy slack sharing algorithm for traditional applications to deal with applications represented by AND/OR graphs. Then, using the statistical information about the applications, we propose a few variations of speculative scheduling algorithms that intend to save energy by reducing the number of speed changes (and thus the overhead) while ensuring that the applications meet the timing constraints. The performance of the algorithms is analyzed with respect to energy savings. The results surprisingly show that the greedy scheme is better than some speculative schemes and that the greedy scheme is good enough when a reasonable minimal speed exists in the system.