Temperature aware online algorithms for scheduling equal length jobs

Authors:
Martin Birks;Stanley P. Y. Fung
Affiliations:
Department of Computer Science, University of Leicester, Leicester, United Kingdom;Department of Computer Science, University of Leicester, Leicester, United Kingdom
Venue:
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Year:
2011

Citing 8
Cited 2

Online scheduling with hard deadlines

Journal of Algorithms
Dynamic Speed Scaling to Manage Energy and Temperature

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic problems in power management

ACM SIGACT News
Temperature aware task scheduling in MPSoCs

Proceedings of the conference on Design, automation and test in Europe
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help

SIAM Journal on Computing
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Temperature aware online scheduling with a low cooling factor

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On-line scheduling on a single machine: maximizing the number of early jobs

Operations Research Letters

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 study the online scheduling problem of maximising job completion subject to temperature constraints. In our setting, jobs are of equal length and have deadlines and heat contributions. The algorithm tries to complete as many jobs as possible before their deadlines while keeping the temperature of the system within an acceptable limit. We give an optimal algorithm for the case where preemption is not allowed. Then we consider the case of preemption and prove a number of lower bounds, showing that for many combination of system parameters, preemption (with restart) is not helpful in improving the competitiveness.