Approximation algorithm for the temperature-aware scheduling problem

Sushu Zhang, Karam S. Chatha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

133 Citations (Scopus)

Abstract

The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the problem is NP-hard, and present a pseudo-polynomial optimal algorithm and a fully polynomial time approximation technique (FPTAS) for the problem. The FPTAS technique is able to generate solutions in polynomial time that are guaranteed to be within a designer specified quality bound (QB) (say within 1% of the optimal). We evaluate our techniques by experimentation with multimedia and synthetic benchmarks mapped on the 70nm CMOS technology processor. The experimental results demonstrate our techniques are able to match optimal solutions when QB is set at 5%, can generate solutions that are quite close to optimal (< 5%) even when QB is set at higher values (50%), and executes in few seconds (with QB > 25%) for large task sets with 120 nodes (while the optimal solution takes several hundred seconds). We also analyze the effect of different thermal parameters, such as the initial temperature, the final temperature and the thermal resistance.

Original languageEnglish (US)
Title of host publicationIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
Pages281-288
Number of pages8
DOIs
StatePublished - 2007
Event2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD - San Jose, CA, United States
Duration: Nov 4 2007Nov 8 2007

Other

Other2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD
CountryUnited States
CitySan Jose, CA
Period11/4/0711/8/07

Fingerprint

Approximation algorithms
Scheduling
Polynomials
Heat resistance
Temperature
Computational complexity
Electric potential
Hot Temperature

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Zhang, S., & Chatha, K. S. (2007). Approximation algorithm for the temperature-aware scheduling problem. In IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD (pp. 281-288). [4397278] https://doi.org/10.1109/ICCAD.2007.4397278

Approximation algorithm for the temperature-aware scheduling problem. / Zhang, Sushu; Chatha, Karam S.

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD. 2007. p. 281-288 4397278.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, S & Chatha, KS 2007, Approximation algorithm for the temperature-aware scheduling problem. in IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD., 4397278, pp. 281-288, 2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD, San Jose, CA, United States, 11/4/07. https://doi.org/10.1109/ICCAD.2007.4397278
Zhang S, Chatha KS. Approximation algorithm for the temperature-aware scheduling problem. In IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD. 2007. p. 281-288. 4397278 https://doi.org/10.1109/ICCAD.2007.4397278
Zhang, Sushu ; Chatha, Karam S. / Approximation algorithm for the temperature-aware scheduling problem. IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD. 2007. pp. 281-288
@inproceedings{207b149596d54e17b25a59c4bcac437a,
title = "Approximation algorithm for the temperature-aware scheduling problem",
abstract = "The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the problem is NP-hard, and present a pseudo-polynomial optimal algorithm and a fully polynomial time approximation technique (FPTAS) for the problem. The FPTAS technique is able to generate solutions in polynomial time that are guaranteed to be within a designer specified quality bound (QB) (say within 1{\%} of the optimal). We evaluate our techniques by experimentation with multimedia and synthetic benchmarks mapped on the 70nm CMOS technology processor. The experimental results demonstrate our techniques are able to match optimal solutions when QB is set at 5{\%}, can generate solutions that are quite close to optimal (< 5{\%}) even when QB is set at higher values (50{\%}), and executes in few seconds (with QB > 25{\%}) for large task sets with 120 nodes (while the optimal solution takes several hundred seconds). We also analyze the effect of different thermal parameters, such as the initial temperature, the final temperature and the thermal resistance.",
author = "Sushu Zhang and Chatha, {Karam S.}",
year = "2007",
doi = "10.1109/ICCAD.2007.4397278",
language = "English (US)",
isbn = "1424413826",
pages = "281--288",
booktitle = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD",

}

TY - GEN

T1 - Approximation algorithm for the temperature-aware scheduling problem

AU - Zhang, Sushu

AU - Chatha, Karam S.

PY - 2007

Y1 - 2007

N2 - The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the problem is NP-hard, and present a pseudo-polynomial optimal algorithm and a fully polynomial time approximation technique (FPTAS) for the problem. The FPTAS technique is able to generate solutions in polynomial time that are guaranteed to be within a designer specified quality bound (QB) (say within 1% of the optimal). We evaluate our techniques by experimentation with multimedia and synthetic benchmarks mapped on the 70nm CMOS technology processor. The experimental results demonstrate our techniques are able to match optimal solutions when QB is set at 5%, can generate solutions that are quite close to optimal (< 5%) even when QB is set at higher values (50%), and executes in few seconds (with QB > 25%) for large task sets with 120 nodes (while the optimal solution takes several hundred seconds). We also analyze the effect of different thermal parameters, such as the initial temperature, the final temperature and the thermal resistance.

AB - The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the problem is NP-hard, and present a pseudo-polynomial optimal algorithm and a fully polynomial time approximation technique (FPTAS) for the problem. The FPTAS technique is able to generate solutions in polynomial time that are guaranteed to be within a designer specified quality bound (QB) (say within 1% of the optimal). We evaluate our techniques by experimentation with multimedia and synthetic benchmarks mapped on the 70nm CMOS technology processor. The experimental results demonstrate our techniques are able to match optimal solutions when QB is set at 5%, can generate solutions that are quite close to optimal (< 5%) even when QB is set at higher values (50%), and executes in few seconds (with QB > 25%) for large task sets with 120 nodes (while the optimal solution takes several hundred seconds). We also analyze the effect of different thermal parameters, such as the initial temperature, the final temperature and the thermal resistance.

UR - http://www.scopus.com/inward/record.url?scp=50249139685&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50249139685&partnerID=8YFLogxK

U2 - 10.1109/ICCAD.2007.4397278

DO - 10.1109/ICCAD.2007.4397278

M3 - Conference contribution

SN - 1424413826

SN - 9781424413829

SP - 281

EP - 288

BT - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

ER -