16160 articles – 32635 references  [version française]
HAL: hal-00688069, version 2

Detailed view  Export this paper
IEEE 18th International Conference on Embedded and Real-Time Computing Systems and Applications, Seoul : Korea, Republic Of (2012)
Available versions:
Real-Time Scheduling of Energy Harvesting Embedded Systems with Timed Automata
Yasmina Abdeddaïm 1, Damien Masson 1
(2012-08-19)

In this paper, we propose feasibility and schedulability tests for a real-time scheduling problem under energy constraints. We first introduce the problem and show how to model it using timed automata. We propose then a feasibility test based on CTL model checking and schedulability tests for EDF and fixed priority algorithms. Our approach also permits to generate a feasible schedule if one exists and otherwise to find the good characteristics of a battery to make the problem feasible. It is finally possible to generate schedules that optimize some criteria, such as the number of mode switching (battery charge or discharge), the minimal and the maximal energy level, or the number of preemptions. The approach is illustrated by some experiments using the model checking tool U PPAAL.
1:  Laboratoire d'Informatique Gaspard-Monge (LIGM)
Université Paris-Est Marne-la-Vallée (UPEMLV) – ESIEE – Ecole des Ponts ParisTech – Fédération de Recherche Bézout – CNRS : UMR8049
Computer Science/Embedded Systems

Computer Science/Other
power aware real time scheduling – energy harvesting systems – timed automata
Attached file list to this document: 
PDF
rtcshal2012.pdf(582.5 KB)