Scalably scheduling processes with arbitrary speedup curves

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 685-692

  Edmonds, Jeff ^a   Pruhs, Kirk ^b  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

MULTIPLE PROCESSORS; NON-CLAIRVOYANT ALGORITHMS; SCHEDULING JOBS; SCHEDULING PROCESS; SPEED UP; SUBLINEAR;

SCHEDULING ALGORITHMS;

EID: 70349088161     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.75     Document Type: Conference Paper

References (16)

1. 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.
2. Piotr Berman and Chris Coulston. Speed is more powerful than clairvoyance. Nordic Journal of Computing, 6(2):181-193, 1999.
3. Jeff Edmonds. Scheduling in the dark. Theoretial Computer Science, 235:109-141, 2000.
4. Jeff Edmonds. On the competitiveness of aimd-tcp within a general network. In LATIN, pages 567-576, 2004.
5. Jeff Edmonds, Suprakash Datta, and Patrick Dymond. Tcp is competitive against a limited adversary. In SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 174-183, 2003.
6. Jeff Edmonds and Kirk Pruhs. Multicast pull scheduling: When fairness is fine. Algorithmica, 36(3):315-330, 2003.
7. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. J. ACM, 47(4):617-643, 2000.
8. Bala Kalyanasundaram and Kirk Pruhs. Minimizing flow time nonclairvoyantly. J. ACM, 50(4):551-567, 2003.
9. Rick Merritt. Cpu designers debate multi-core future. EE Times, June 2008.
10. Rajeev Motwani, Steven Phillips, and Eric Torng. Non-clairvoyant scheduling. Theoretical Computer Science, 130:17-47, 1994.
11. Cynthia Phillips, Cliff Stein, Eric Torng, and Joel Wein. Optimal time-critical scheduling via resource augmentation. Algorithmica, pages 163-200, 2002.
12. Kirk Pruhs. Competitive online scheduling for server systems. SIGMETRICS Performance Evaluation Review, 34(4):52-58, 2007.
13. Kirk Pruhs, Jiri Sgall, and Eric Torng. Online scheduling. In Handbook on Scheduling. CRC Press, 2004.
14. Julien Robert and Nicolas Schabanel. Non-clairvoyant batch sets scheduling: Fairness is fair enough. In European Symposium on Algorithms, pages 741-753, 2007.
15. Julien Robert and Nicolas Schabanel. Pull-based data broadcast with dependencies: be fair to users, not to items. In ACM-SIAM Symposium on Discrete Algorithms, 2007.
16. Julien Robert and Nicolas Schabanel. Non-clairvoyant scheduling with precedence constraints. In Symposium on Discrete Algorithms, pages 491-500, 2008.