𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Real-time task scheduling for energy-aware embedded systems

✍ Scribed by Vishnu Swaminathan; Krishnendu Chakrabarty


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
339 KB
Volume
338
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis


We present a new approach for scheduling workloads containing periodic tasks in real-time systems. The proposed approach minimizes the total energy consumed by the task set and guarantees that the deadline for every periodic task is met. Energy is a scarce resource for embedded systems, and energy consumption must be carefully balanced against real-time responsiveness. As embedded software becomes a larger component of system-on-a-chip design, energy management using the operating system becomes increasingly important. We present a mixed-integer linear programming model for the NP-complete scheduling problem and solve it for moderate-sized problem instances using a public-domain solver. For larger task sets, we present a novel low-energy earliest-deadline-first (LEDF) scheduling algorithm and apply it to two real-life task sets. We also present extended-LEDF (E-LEDF), a modified version of LEDF that considers more practical scenarios. Our results show that energy can be conserved in embedded real-time systems using energy-aware task scheduling.


πŸ“œ SIMILAR VOLUMES


Minimal schedulability interval for real
✍ Annie Choquet-Geniet; Emmanuel Grolleau πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 286 KB

We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have o sets, share critical resources and be precedence constrained. O -line scheduling should be of great help for such systems, but methods proposed in the literature cannot de

Modelling heterogeneous processor schedu
✍ J.F. Leathrum; R.R. Mielke; J.W. Stoughton πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 748 KB

A new model is presented to describe data-flow algorithms implemented in a multiprocessing system. Called the resource/data flow graph (RDFG), the model explicitly represents cyclo-statie processor schedules as circuits of processor ares that reflect the order that processors execute graph nodes. Th