Battery Aware Dynamic Scheduling for Periodic Task Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Battery Aware Dynamic Scheduling for Periodic Task Graphs


Battery lifetime is a primary design constraint for mobile embedded systems. It has been shown to depend heavily on the load current profile (i.e. evolution of the current drawn over time). However, up to now, very few low-power scheduling policies take this fact into account. We explore how scheduling guidelines drawn from battery models can help in the extension of battery capacity. We proposed a 'Battery-Aware Scheduling' methodology for periodically arriving task-graphs (Directed Acyclic Graph) with real time deadlines and precedence constraints. The methodology presented divides the problem into two steps. First, a good DVS algorithms dynamically determines the minimum frequency of execution. Then, a greedy algorithm allows a near optimal priority function to choose the task which would maximize slack recovery. Battery simulations carried out on the profile generated by our approach for a large set of task-graphs show that battery life time is extended up to 23.3% compared to existing dynamic scheduling schemes.
Fichier principal
Vignette du fichier
wpdrts06.pdf (301.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00000463 , version 1 (20-11-2006)


  • HAL Id : inria-00000463 , version 1


Venkat Rao, Gaurav Singhal, Nicolas Navet, Anshul Kumart, G.S. Visweswaran. Battery Aware Dynamic Scheduling for Periodic Task Graphs. 14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS 2006), Apr 2006, Island of Rhodes/Greece. ⟨inria-00000463⟩
117 View
165 Download


Gmail Facebook Twitter LinkedIn More