A Pseudo-Linear Time Algorithm for the Optimal Discrete Speed Minimizing Energy Consumption - Inria EPFL Access content directly
Journal Articles Discrete Event Dynamic Systems Year : 2021

A Pseudo-Linear Time Algorithm for the Optimal Discrete Speed Minimizing Energy Consumption

Abstract

We consider the classical problem of minimizing off-line the total energy consumption required to execute a set of n real-time jobs on a single processor with a finite number of available speeds. Each real-time job is defined by its release time, size, and deadline (all bounded integers). The goal is to find a processor speed schedule, such that no job misses its deadline and the energy consumption is minimal. We propose a pseudo-linear time algorithm that checks the schedulability of the given set of n jobs and computes an optimal speed schedule. The time complexity of our algorithm is in O(n), to be compared with O(nlog(n)) for the best known solution. Besides the complexity gain, the main interest of our algorithm is that it is based on a completely different idea: instead of computing the critical intervals, it sweeps the set of jobs and uses a dynamic programming approach to compute an optimal speed schedule. Our linear time algorithm is still valid (with some changes) when arbitrary (non-convex) power functions and when switching costs are taken into account.
Fichier principal
Vignette du fichier
Jdeds2020 (1).pdf (510.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03030416 , version 1 (30-11-2020)
hal-03030416 , version 2 (30-11-2020)

Identifiers

Cite

Bruno Gaujal, Alain Girault, Stéphan Plassart. A Pseudo-Linear Time Algorithm for the Optimal Discrete Speed Minimizing Energy Consumption. Discrete Event Dynamic Systems, 2021, 31, pp.163-184. ⟨10.1007/s10626-020-00327-9⟩. ⟨hal-03030416v2⟩
198 View
208 Download

Altmetric

Share

Gmail Facebook X LinkedIn More