Approximating the Throughput by Coolest First Scheduling

Abstract : We study a temperature-aware scheduling problem aiming in maximizing the throughput of a set of unit-length jobs, each one having its own heat contribution, on a single processor operating under a strict temperature threshold. Following a simplified model for the processor’s thermal behavior, proposed by Chrobak et al.[9], we analyze the approximation factor of the natural CoolestFirst scheduling algorithm for jobs with common release dates and deadlines. We first prove a $\frac{k}{k+1}$ factor, where $k$ depends on a partition of the jobs according to their heat contributions. Next, we refine our partition and provide a linear program that shows a lower bound of 0.72 on the approximation factor.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00841914
Contributor : Zois Georgios <>
Submitted on : Friday, July 5, 2013 - 4:45:12 PM
Last modification on : Thursday, March 21, 2019 - 2:41:52 PM

Links full text

Identifiers

Citation

Christoph Dürr, Ioannis Milis, Julien Robert, Georgios Zois. Approximating the Throughput by Coolest First Scheduling. WAOA 2012 - 10th International Workshop on Approximation and Online Algorithms, Sep 2012, Ljubljana, Slovenia. pp.187-200, ⟨10.1007/978-3-642-38016-7_16⟩. ⟨hal-00841914⟩

Share

Metrics

Record views

221