| | |
Summary: Determining Optimal Processor Speeds for Periodic
Real-Time Tasks with Different Power Characteristics*
Hakan Aydin, Rami Melhem, Daniel Moss6
Computer Science Department
University of Pittsburgh
Pittsburgh, PA 15260
aydin, melhem, mosse@cs.pitt.edu
Abstract
In this paper, we provide an efficient solution for peri-
odic real-time tasks with (potentially) different power
consumption characteristics. We show that, a task T,
can run at a constant speed 5';.at every instance without
hurting optimality. We sketch an O(n2log n) algorithm
to compute the optimal S;.values. We also prove that
the EDF (Earliest Deadline First) scheduling policy can
be used to obtain a feasible schedule with these optimal
speed values.
1 Introduction
With the advent of portable and hand-held coinput-
ing/communicat ion systems, power consumption has re-
|
