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

Bruno Gaujal 1 Nicolas Navet 1 Cormac Walsh 2
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Type de document :
Article dans une revue
ACM Transactions on Embedded Computing Systems (TECS), ACM, 2005, 4 (4)
Liste complète des métadonnées

https://hal.inria.fr/inria-00099957
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:12:53
Dernière modification le : jeudi 11 janvier 2018 - 06:20:06

Identifiants

  • HAL Id : inria-00099957, version 1

Collections

Citation

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), ACM, 2005, 4 (4). 〈inria-00099957〉

Partager

Métriques

Consultations de la notice

172