Scheduling to Minimize Power Consumption using Submodular Functions
Name
Demaine-Scheduling to minimize.pdf
Size
222.44 KB
Format
Adobe PDF
Checksum (MD5)
5196882cef25d3f3ec678434522bf3b5
Author(s)
Demaine, Erik D.
Zadimoghaddam, Morteza
Date Issued
June 2010
Journal
Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '10)
Publisher
Association for Computing Machinery (ACM)
Citation
Erik D. Demaine and Morteza Zadimoghaddam. 2010. Scheduling to minimize power consumption using submodular functions. In Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures (SPAA '10). ACM, New York, NY, USA, 21-29.
Version
Author's final manuscript
Abstract
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multi-interval offline task scheduling to minimize power usage. Here each processor has an arbitrary specified power consumption to be turned on for each possible time interval, and each job has a specified list of time interval/processor pairs during which it could be scheduled. (A processor need not be in use for an entire interval it is turned on.) If there is a feasible schedule, our algorithm finds a feasible schedule with total power usage within an O(log n) factor of optimal, where n is the number of jobs.(Even in a simple setting with one processor, the problem is Set-Cover hard.) If not all jobs can be scheduled and each job has a specified value, then our algorithm finds a schedule of value at least (1-ε) Z and power usage within an O(log(1/ε)) factor of the optimal schedule of value at least Z, for any specified Z and ε > 0. At the foundation of our work is a general framework for logarithmic approximation to maximizing any submodular function subject to budget constraints.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1810479.1810483
