Shortest Path Algorithms for Real-Time Scheduling of FIFO tasks with Minimal Energy Use - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Embedded Computing Systems (TECS) Année : 2005

Shortest Path Algorithms for Real-Time Scheduling of FIFO tasks with Minimal Energy Use

Bruno Gaujal
Nicolas Navet
  • Fonction : Auteur
  • PersonId : 830599

Résumé

We present an algorithm for scheduling a set of non-recurrent tasks (or jobs) with FIFO real-time constraints so as to minimize the total energy consumed when the tasks are performed on a dynamically variable voltage processor. Our algorithm runs in linear time and is thus an improvement over the classical algorithm of Yao et al. in this case. It was inspired by considering the problem as a shortest path problem. We also propose an algorithm to deal with the case where the processor has only a limited number of clock frequencies. This algorithm gives the optimum schedule with the minimum number of speed changes, which is important when the speed switching overhead cannot be neglected. All our algorithms are linear in the number of tasks if the arrivals and deadlines are sorted and need O(N\log N) time otherwise. These complexities are shown to be the best possible. Finally, we extend our results to fluid tasks and to non-convex cost functions.
Fichier non déposé

Dates et versions

inria-00099957 , version 1 (26-09-2006)

Identifiants

Citer

Bruno Gaujal, Nicolas Navet, Cormac Walsh. Shortest Path Algorithms for Real-Time Scheduling of FIFO tasks with Minimal Energy Use. ACM Transactions on Embedded Computing Systems (TECS), 2005, 4 (4), ⟨10.1145/1113830.1113838⟩. ⟨inria-00099957⟩
164 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More