Speed Scaling to Manage Temperature.

Abstract : We consider the speed scaling problem where the quality of service objective is deadline feasibility and the power objective is temperature. In the case of batched jobs, we give a simple algorithm to compute the optimal schedule. For general instances, we give a new online algorithm, and obtain an upper bound on the competitive ratio of this algorithm that is an order of magnitude better than the best previously known bound upper bound on the competitive ratio for this problem.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-00786200
Contributor : Equipe Roma <>
Submitted on : Tuesday, September 3, 2013 - 11:44:13 AM
Last modification on : Thursday, May 16, 2019 - 3:40:34 PM
Long-term archiving on : Wednesday, December 4, 2013 - 2:45:12 AM

File

tapas11.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Leon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs. Speed Scaling to Manage Temperature.. TAPAS - 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, 2011, Rome, Italy. pp.9-20, ⟨10.1007/978-3-642-19754-3_4⟩. ⟨hal-00786200⟩

Share

Metrics

Record views

225

Files downloads

365