Low Power Round-Robin Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Low Power Round-Robin Scheduling

Raul Brito
  • Function : Author
  • PersonId : 831069
Nicolas Navet
  • Function : Author
  • PersonId : 830599


Energy consumption is becoming a crucial issue in the design of digital systems especially when considering portable and embedded systems due to their operational dependency on batteries. The processor being an important source of energy consumption, energy-aware scheduling strategies that decrease the CPU speed when possible enable to achieve significant energy savings. In this paper, we study the low-power scheduling under the Round-Robin policy which is widely available since it is part of the Posix1003.1b standard. An algorithm that computes the minimum processor speed for scheduling a job set under Round-Robin is provided. It relies on an efficient feasibility test that is also a contribution of this paper. Finally, we present mechanisms that are necessary for ensuring schedulability at run-time and that reduces consumption when jobs do not require their worst-case execution time. A counter-intuitive result shown in this study is that a job set might not be feasible at maximum frequency while being feasible with a lower frequency. This implies that even without interests in energy saving, lower frequencies have to be considered for feasibility.
Not file

Dates and versions

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


  • HAL Id : inria-00099959 , version 1


Raul Brito, Nicolas Navet. Low Power Round-Robin Scheduling. 12ème Conférence Internationale sur les Systèmes Temps Réel - RTS'04, BIRP, 2004, Paris, France. ⟨inria-00099959⟩
128 View
0 Download


Gmail Facebook Twitter LinkedIn More