Dynamic speed scaling to manage energy and temperature

Dynamic speed scaling to manage energy and temperature (2004)

Cached

Download Links

[www.cs.pitt.edu]

Other Repositories/Bibliography

DBLP

by Nikhil Bansal

Venue:	In IEEE Syposium on Foundations of Computer Science
Citations:	72 - 13 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Dynamic speed scaling to manage energy and temperature	INFERENCE
AUTHOR NAME	Nikhil Bansal	SVM HeaderParse 0.2
AUTHOR AFFIL	IBM T. J. Watson Research Center	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 218; Yorktown Heights, NY, 10598, USA	SVM HeaderParse 0.2
ABSTRACT	We first consider online speed scaling algorithms to minimize the energy used subject to the constraint that every job finishes by its deadline. We assume that the power required to run at speed ¡ is ¢¤ £. We provide a tight bound on the competitive ratio of the previously pro-posed Optimal Available algorithm. This improves the best known competitive ratio by a factor � � of. We then introduce a new online algorithm, and show that this algorithm’s competitive ratio is at � £ �� £ �¨��¥�¥�� most. This competitive ratio is significantly better and is � �� approximately for large �. Our result is essentially tight for large �. In particular, as � approaches infinity, we show that any algorithm must have competitive ratio �� (up to lower order terms). We then turn to the problem of dynamic speed scaling to minimize the maximum temperature that the device ever reaches, again subject to the constraint that all jobs finish by their deadlines. We assume that the device cools according to Fourier’s law. We show how to solve this problem in polynomial time, within any error bound, using the Ellipsoid algorithm. 1.	SVM HeaderParse 0.2
YEAR	2004	INFERENCE
VENUE	In IEEE Syposium on Foundations of Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	520--529	INFERENCE
CITATIONS	16 found	ParsCit 1.0