The Optimality of PFPasap Algorithm for Fixed-Priority Energy-Harvesting Real-Time Systems

Abstract : The paper addresses the real-time xed-priority scheduling problem for battery-powered embedded systems whose energy storage unit is replenished by an environmental energy source. In this context, a task may meet its deadline only if its cost of energy can be satis ed early enough. Hence, a scheduling policy for such a system should account for properties of the source of energy, capacity of the energy storage unit and tasks cost of energy. Classical fixed-priority schedulers are no more suitable for this model. Based on these motivations, we propose PFPasap an optimal scheduling algorithm that handles both energy and timing constraints. Furthermore, we state the worst case scenario for non concrete tasksets scheduled with this algorithm and build a necessary and su cient feasibility condition for non concrete tasksets. Moreover, a minimal bound of the storage unit capacity that keeps a taskset schedulable with PFPasap is also proposed. Finally, we validate the proposed theory with large scale simulations and compare our algorithm with other existing ones.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00783607
Contributor : Damien Masson <>
Submitted on : Monday, April 29, 2013 - 4:53:45 PM
Last modification on : Wednesday, July 4, 2018 - 4:37:55 PM
Long-term archiving on : Tuesday, April 4, 2017 - 1:42:15 AM

File

hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00783607, version 2

Citation

Yasmina Abdeddaïm, Younès Chandarli, Damien Masson. The Optimality of PFPasap Algorithm for Fixed-Priority Energy-Harvesting Real-Time Systems. ECRTS 2013, Jul 2013, France. pp.47--56. ⟨hal-00783607v2⟩

Share

Metrics

Record views

464

Files downloads

591