Speed scaling of processes with arbitrary speedup curves on a multiprocessor

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 1-10

  Chan, Ho Leung ^a   Edmonds, Jeff ^b   Pruhs, Kirk ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b YORK UNIVERSITY   (Canada)

^c UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; FLOW-TIME; LOWER BOUNDS; POWER FUNCTIONS; SIDE EFFECT; SINGLE PROCESSORS; SPEED SCALING; UPPER BOUND;

CONTROL THEORY; MULTIPROCESSING SYSTEMS;

ALGORITHMS;

EID: 70449625501     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1583994     Document Type: Conference Paper

References (24)

1. Susanne Albers and Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms, 3(4), 2007.
2. Nikhil Bansal, Ho-Leung Chan, Tak-Wah Lam, and Lap-Kei Lee. Scheduling for bounded speed processors. In Proc. of International Colloquium on Automata, Languages and Programming, ICALP, pages 409-420, 2008.
3. Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs. Improved bounds for speed scaling in devices obeying the cube-root rule. In to appear in ICALP 2009, 2008.
4. Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs. Speed scaling with an arbitrary power function. In SODA, pages 693-701, 2009.
5. Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs. Speed scaling to manage energy and temperature. JACM, 54(1), 2007.
6. Nikhil Bansal, Kirk Pruhs, and Cliff Stein. Speed scaling for weighted flow time. In SODA '07: Proceedings of the eighteenth annual ACM-SIAM Symposium on Discrete Algorithms, pages 805-813, 2007.
7. Nikhil Bansal, Kirk Pruhs, and Cliff Stein. Speed scaling for weighted flow time. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 805-813, 2007.
8. Luca Becchetti and Stefano Leonardi. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM, 51(4):517-539, 2004.
9. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Online weighted flow time and deadline scheduling. J. Discrete Algorithms, 4(3):339-352, 2006.
10. Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam, Lap-Kei Lee, Alberto Marcheti-Spaccamela, and Kirk Pruhs. Nonclairvoyant speed scaling for flow and energy. In STACS, pages 255-264, 2009.
11. Jeff Edmonds. Scheduling in the dark. Theor. Comput. Sci., 235(1):109-141, 2000.
12. Jeff Edmonds. On the competitiveness of AIMD-TCP within a general network. In LATIN, 2004.
13. Jeff Edmonds, Suprakash Datta, and Patrick Dymond. TCP is competitive against a limited adversary. In SPAA, pages 174-183, 2003.
14. Jeff Edmonds and Kirk Pruhs. Scalably scheduling processes with arbitrary speedup curves. In SODA, pages 685-692, 2009.
15. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. J. ACM, 47(4):617-643, 2000.
16. Bala Kalyanasundaram and Kirk Pruhs. Minimizing flow time nonclairvoyantly. J. ACM, 50(4):551-567, 2003.
17. Tak-Wah Lam, Lap-Kei Lee, Isaac To, and Prudence Wong. Speed scaling functions for flow time scheduling based on active job count. In Proc. of European Symposium on Algorithms, ESA, pages 647-659, 2008.
18. Rick Merritt. Cpu designers debate multi-core future. EE Times, June 2008.
19. Rajeev Motwani, Steven Phillips, and Eric Torng. Nonclairvoyant scheduling. Theorertical Computer Science, 130(1):17-47, 1994.
20. Kirk Pruhs. Competitive online scheduling for server systems. SIGMETRICS Performance Evaluation Review, 34(4):52-58, 2007.
21. Kirk Pruhs, Jiri Sgall, and Eric Torng. Online scheduling. In Handbook on Scheduling. CRC Press, 2004.
22. Kirk Pruhs, Patchrawat Uthaisombut, and Gerhard J. Woeginger. Getting the best response for your erg. ACM Transactions on Algorithms, 4(3), 2008.
23. Julien Robert and Nicolas Schabanel. Non-clairvoyant batch sets scheduling: Fairness is fair enough. In European Symposium on Algorithms, pages 741-753, 2007.
24. Julien Robert and Nicolas Schabanel. Non-clairvoyant scheduling with precedence constraints. In Symposium on Discrete Algorithms, pages 491-500, 2008.