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

Authors:
Martin Birks;Daniel Cole;Stanley P. Fung;Huichao Xue
Affiliations:
Department of Computer Science, University of Leicester, Leicester, UK LE1 7RH;Department of Computer Science, University of Pittsburgh, Pittsburgh, USA;Department of Computer Science, University of Leicester, Leicester, UK LE1 7RH;Department of Computer Science, University of Pittsburgh, Pittsburgh, USA
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 14
Cited 0

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
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
Getting the best response for your erg

ACM Transactions on Algorithms (TALG)
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
Energy-efficient algorithms

Communications of the ACM
A survey of buffer management policies for packet switches

ACM SIGACT News
Competitive analysis of online real-time scheduling algorithms under hard energy constraint

Real-Time Systems
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

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 first give an optimally competitive randomized algorithm. Then we give a constant competitive randomized algorithm that allows a tradeoff between the maximum heat contribution of jobs and the competitiveness. Finally we consider the multiple processor case and give several tight upper and lower bounds.