ERTOS Public Seminar

Minimising the Energy Consumption of Real-Time Tasks with Precedence Constraints on A Single Processor

Dr. Hui Wu, University of New South Wales

Time/Venue

9th February 2006, 2pm

National ICT Australia Ltd, Level 1 Seminar Room, 223 Anzac Parade (Building L5), Kensington NSW 2052

Abstract

Energy-aware task scheduling is critical for real-time embedded systems. Although dynamic power has traditionally been a primary source of processor power consumption, leakage power is becoming an increasingly important source of processor power consumption.

In this talk, I will present two optimal energy-aware polynomial-time algorithms for scheduling a set of tasks with release times, deadlines and precedence constraints on a single processor with continuous voltages. Our algorithms are guaranteed to minimise the total energy consumption of all tasks under two power models: the dynamic power model where the dynamic power dominates the processor power consumption and the dynamic and leakage power model where both dynamic power and leakage power dominate the processor power consumption. Under the dynamic power model, the time complexity of our algorithm is O(e+n *ln(n)), where n is the number of tasks and e is the number of edges in the precedence graph. Under the dynamic and leakage power model, the time complexity of our algorithm is O(n*n *ln(n)).