Shortest Path Algorithms for Real-Time Scheduling of FIFO tasks with Minimal Energy Use
| dc.contributor | Real time and interoperability (TRIO) ; INRIA Lorraine ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS) | |
| dc.contributor | Max-plus algebras and mathematics of decision (MAXPLUS) ; Inria Paris-Rocquencourt ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria) | |
| dc.creator | Gaujal, Bruno | |
| dc.creator | Navet, Nicolas | |
| dc.creator | Walsh, Cormac | |
| dc.date | 2005 | |
| dc.date.accessioned | 2026-07-25T13:46:50Z | |
| dc.description | Article dans revue scientifique avec comité de lecture. internationale. | |
| dc.description | International audience | |
| dc.description | 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. | en |
| dc.identifier | inria-00099957 | |
| dc.identifier | https://inria.hal.science/inria-00099957 | |
| dc.identifier | DOI: 10.1145/1113830.1113838 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/20295 | |
| dc.language | en | |
| dc.publisher | CCSD | |
| dc.publisher | ACM | |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/10.1145/1113830.1113838 | |
| dc.source | ISSN: 1539-9087 | |
| dc.source | EISSN: 1558-3465 | |
| dc.source | ACM Transactions on Embedded Computing Systems (TECS) | |
| dc.source | https://inria.hal.science/inria-00099957 | |
| dc.source | ACM Transactions on Embedded Computing Systems (TECS), 2005, 4 (4), ⟨10.1145/1113830.1113838⟩ | |
| dc.subject | real-time systems | fr |
| dc.subject | low-power | fr |
| dc.subject | scheduling | fr |
| dc.subject | faible consommation | fr |
| dc.subject | ordonnancement | fr |
| dc.subject | variation dynamique du voltage | fr |
| dc.subject | dynamic voltage scaling | fr |
| dc.subject | systèmes temps réel | fr |
| dc.subject | [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] | |
| dc.title | Shortest Path Algorithms for Real-Time Scheduling of FIFO tasks with Minimal Energy Use | en |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | Journal articles |