Scheduling jobs with varying parallelizability to reduce variance

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 11-20

  Gupta, Anupam ^a   Im, Sungjin ^b   Krishnaswamy, Ravishankar ^a   Moseley, Benjamin ^b   Pruhs, Kirk ^c  

^a Carnegie Mellon University ^*  (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c Learning Research and Development Ctr   (United States)

Author keywords

Online algorithms; Scheduling algorithms

Indexed keywords

COMPETITIVE ALGORITHMS; ONLINE ALGORITHMS; PAGE SIZES; SCHEDULING JOBS; SPEED-UPS;

SCHEDULING ALGORITHMS;

EID: 77954924926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810482     Document Type: Conference Paper

References (17)

1. Nikhil Bansal, Ravishankar Krishnaswamy, and Viswanath Nagarajan. Better scalable algorithms for broadcast scheduling. Technical report, Carnegie Mellon University, 2009.
2. Nikhil Bansal and Kirk Pruhs. Server scheduling in the lp norm: a rising tide lifts all boat. In ACM Symposium on Theory of Computing, pages 242-250, 2003.
3. 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.
4. Ho-Leung Chan, Jeff Edmonds, and Kirk Pruhs. Speed scaling of processes with arbitrary speedup curves on a multiprocessor. In SPAA, pages 1-10, 2009.
5. Jeff Edmonds. Scheduling in the dark. Theor. Comput. Sci., 235(1):109-141, 2000.
6. Jeff Edmonds, Donald D. Chinn, Tim Brecht, and Xiaotie Deng. Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics. J. Scheduling, 6(3):231-250, 2003.
7. Jeff Edmonds and Kirk Pruhs. Multicast pull scheduling: When fairness is fine. Algorithmica, 36(3):315-330, 2003.
8. Jeff Edmonds and Kirk Pruhs. Scalably scheduling processes with arbitrary speedup curves. In SODA, pages 685-692, 2009.
9. Sungjin Im and Benjamin Moseley. An online scalable algorithm for average flow time in broadcast scheduling. In ACM-SIAM Symposium on Discrete Algorithms, page To Appear, 2010.
10. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. J. ACM, 47(4):617-643, 2000.
11. Bala Kalyanasundaram and Kirk Pruhs. Minimizing flow time nonclairvoyantly. J. ACM, 50(4):551-567, 2003.
12. Rajeev Motwani, Steven Phillips, and Eric Torng. Nonclairvoyant scheduling. Theorertical Computer Science, 130(1):17-47, 1994.
13. Kirk Pruhs. Competitive online scheduling for server systems. SIGMETRICS Performance Evaluation Review, 34(4):52-58, 2007.
14. Kirk Pruhs, Jiri Sgall, and Eric Torng. Online scheduling. In Handbook on Scheduling. CRC Press, 2004.
15. Julien Robert and Nicolas Schabanel. Non-clairvoyant batch sets scheduling: Fairness is fair enough. In European Symposium on Algorithms, pages 741-753, 2007.
16. Julien Robert and Nicolas Schabanel. Non-clairvoyant scheduling with precedence constraints. In ACM-SIAM Symposium on Discrete Algorithms, pages 491-500, 2008.
17. Abraham Silberschatz and Peter Galvin. Operating System Concepts, 4th edition. Addison-Wesley, 1994.