The bell is ringing in speed-scaled multiprocessor scheduling

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 11-18

  Greiner, Gero ^a   Nonner, Tim ^b   Souza, Alexander ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Approximation algorithms; Competitive analysis; Dynamic speed scaling; Energy minimization; Online algorithms; Randomized algorithms; Scheduling algorithms

Indexed keywords

COMPETITIVE ANALYSIS; DYNAMIC SPEED SCALING; ENERGY MINIMIZATION; ON-LINE ALGORITHMS; RANDOMIZED ALGORITHMS;

BELLS; COST FUNCTIONS; DYNAMIC ANALYSIS; ELECTRIC LOAD FORECASTING; SCHEDULING ALGORITHMS; SPEED;

APPROXIMATION ALGORITHMS;

EID: 70449657714     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1583996     Document Type: Conference Paper

References (21)

1. Susanne Albers. Personal communication. 2008.
2. Susanne Albers and Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms, 3(4):49, 2007.
3. Susanne Albers, Fabian Müller, and Swen Schmelzer. Speed scaling on parallel processors. In Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'07), pages 289-298, 2007.
4. Nikhil Bansal, David P. Bunde, Ho-Leung Chan, and Kirk Pruhs. Average rate speed scaling. In Proceedings of 84th Latin American Symposium (LATIN'08), pages 240-251, 2008.
5. Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs. Speed scaling with an arbitrary power function. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 693-701, 2009.
6. Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs. Dynamic speed scaling to manage energy and temperature. In Proceedings os 45th Symposium on Foundations of Computer Science (FOCS'04), pages 520-529, 2004.
7. Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs. Speed scaling to manage energy and temperature. J. ACM, 54(1), 2007.
8. Nikhil Bansal, Kirk Pruhs, and Clifford Stein. Speed scaling for weighted flow time. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 805-813, 2007.
9. David M. Brooks, Pradip Bose, Stanley E. Schuster, Hans Jacobson, Prabhakar N. Kudva, Alper Buyuktosunoglu, John-David Wellman, Victor Zyuban, Manish Gupta, and Peter W. Cook. Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro, 20(6):26-44, 2000.
10. David P. Bunde. Power-aware scheduling for makespan and flow. In Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'06), pages 190-196, 2006.
11. Ho-Leung Chan, Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, and Prudence W. H. Wong. Energy efficient online deadline scheduling. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 795-804, 2007.
12. Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Nonclairvoyant speed scaling for flow and energy. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), pages 255-264, 2009.
13. m/n! fuer m = 1, 2, 3, 4, 5, .... Arch. Math. Physik, 61:333-336, 1877.
14. H.W.Becker and John Riordan. The arithmetic of bell and stirling numbers. Amer. J. Math., 70:385-394, 1934.
15. Sandy Irani and Kirk Pruhs. Algorithmic problems in power management. SIGACT News, 36(2):63-76, 2005.
16. Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, and Prudence W. H. Wong. Energy efficient deadline scheduling in two processor systems. In Proccedings of Algorithms and Computation, 18th International Symposium (ISAAC'07), pages 476-487, 2007.
17. Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, and Prudence W. H. Wong. Competitive non-migratory scheduling for flow time and energy. In Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'08), pages 256-264, 2008.
18. Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, and Prudence W. H. Wong. Speed scaling functions for flow time scheduling based on active job count. In Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08), pages 647-659, 2008.
19. László Lovász. Combinatorial problems and exercises. North-Holland, Amsterdam, 1964.
20. Kirk Pruhs, Patchrawat Uthaisombut, and Gerhard J. Woeginger. Getting the best response for your erg. ACM Transactions on Algorithms, 4(3), 2008.
21. F. Frances Yao, Alan J. Demers, and Scott Shenker. A scheduling model for reduced cpu energy. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), pages 374-382, 1995.