Dynamic voltage scaling under EDF revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Real-Time Systems Year : 2007

Dynamic voltage scaling under EDF revisited


Basic algorithms have been proposed in the field of low-power (Yao, F., et al. in Proceedings of lEEE annual foundations of computer science, pp. 374–382, 1995) which compute the minimum energy-schedule for a set of non-recurrent tasks (or jobs) scheduled under EDF on a dynamically variable voltage processor. In this study, we propose improvements upon existing algorithms with lower average and worst-case complexities. They are based on a new EDF feasibility test that helps to identify the “critical intervals”. The complexity of this feasibility test depends on structural characteristics of the set of jobs. More precisely, it depends on how tasks are included one in the other. The first step of the algorithm is to construct the Hasse diagram of the set of tasks where the partial order is defined by the inclusion relation on the tasks. Then, the algorithm constructs the shortest path in a geometrical representation at each level of the Hasse diagram. The optimal processor speed is chosen according to the maximal slope of each path.
Fichier principal
Vignette du fichier
RTS_BGNN2007.pdf (335.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00168449 , version 1 (28-08-2007)



Bruno Gaujal, Nicolas Navet. Dynamic voltage scaling under EDF revisited. Real-Time Systems, 2007, 37 (1), pp.77-97. ⟨10.1007/s11241-007-9029-y⟩. ⟨inria-00168449⟩
322 View
213 Download



Gmail Facebook X LinkedIn More