Speed scaling to manage temperature

Authors:
Leon Atkins;Guillaume Aupy;Daniel Cole;Kirk Pruhs
Affiliations:
Department of Computer Science, University of Bristol;Computer Science Department, ENS Lyon;Computer Science Department, University of Pittsburgh;Computer Science Department, University of Pittsburgh
Venue:
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Year:
2011

Citing 10
Cited 2

Power-Aware Microarchitecture: Design and Modeling Challenges for Next-Generation Microprocessors

IEEE Micro
A scheduling model for reduced CPU energy

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Algorithmic problems in power management

ACM SIGACT News
Speed scaling to manage energy and temperature

Journal of the ACM (JACM)
Performance optimal processor throttling under thermal constraints

CASES '07 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Algorithms for Energy Saving

Efficient Algorithms
Energy-efficient algorithms

Communications of the ACM
Average rate speed scaling

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

On multiprocessor temperature-aware scheduling problems

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
On multiprocessor temperature-aware scheduling problems

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.