Proceedings 13th Euromicro Conference on Real-Time Systems
Download PDF

Abstract

Abstract: In this paper, we provide an efficient solution for periodic real-time tasks with (potentially) different power consumption characteristics. We show that a task TI can run at a constant speed SI at every instance without hurting optimality. We sketch an O(n2log n) algorithm to compute the optimal SI 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.
Like what you’re reading?
Already a member?Sign In
Member Price
$11
Non-Member Price
$21
Add to CartSign In
Get this article FREE with a new membership!