Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints

Authors:
Martin Birks;Daniel Cole;Stanley P. Y. Fung;Huichao Xue
Affiliations:
Department of Computer Science, University of Leicester, Leicester, United Kingdom;Department of Computer Science, University of Pittsburgh, Pittsburgh;Department of Computer Science, University of Leicester, Leicester, United Kingdom;Department of Computer Science, University of Pittsburgh, Pittsburgh
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 11
Cited 2

Online computation and competitive analysis

Online computation and competitive analysis
Competitive non-preemptive call control

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive queueing policies for QoS switches

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A scheduling model for reduced CPU energy

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Speed scaling to manage energy and temperature

Journal of the ACM (JACM)
Temperature aware task scheduling in MPSoCs

Proceedings of the conference on Design, automation and test in Europe
Considering suppressed packets improves buffer management in QoS switches

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic computations: Toward a unified measure of complexity

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Dynamic Thermal Management through Task Scheduling

ISPASS '08 Proceedings of the ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software
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 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 a temperature-aware online deadline scheduling model. The objective is to schedule a number of unit jobs, with release dates, deadlines, weights and heat contributions, to maximize the weighted throughput subject to a temperature threshold. We give an optimal randomized algorithm and another resource-augmented constantcompetitive randomized algorithm for the problem. We also give almost tight upper and lower bounds for the multiple processor case.