Approximation algorithms for unrelated machine scheduling with an energy budget

Authors:
Lin Chen;Wenchang Luo;Guochuan Zhang
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou, China;Faculty of Science, Ningbo University, Ningbo, China;College of Computer Science, Zhejiang University, Hangzhou, China
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 9
Cited 0

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Task Scheduling in Networks (Extended Abstract)

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
A scheduling model for reduced CPU energy

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Optimal voltage allocation techniques for dynamically variable voltage processors

ACM Transactions on Embedded Computing Systems (TECS)
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

SIAM Journal on Computing
Machine scheduling with resource dependent processing times

Mathematical Programming: Series A and B
Speed scaling on parallel processors

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Speed Scaling of Tasks with Precedence Constraints

Theory of Computing Systems
An optimal rounding gives a better approximation for scheduling unrelated machines

Operations Research Letters

Quantified Score

Hi-index	0.03

Visualization

Abstract

We consider the problem of unrelated parallel machine scheduling when the DVS (dynamic voltage scaling) method is used to conserve energy consumption. Given an energy budget, we present (2+ε)- approximation algorithms for the makespan minimization problem under two different settings, the continuous model in which speeds are allowed to be any real number in [smin, smax] and the discrete model in which only d distinct speeds are available. We also show how to derive a 2- approximation algorithm if the energy budget is allowed to be slightly exceeded.