Non-clairvoyant scheduling for minimizing mean slowdown

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 260-270

  Bansal, N ^a   Dhamdhere, K ^a   Konemann J ^b   Sinha, A ^b  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

COMPETITIVE ALGORITHMS; FLOW-TIME; JOB SIZE; LOWER BOUNDS; ON-LINE ALGORITHMS; RESOURCE AUGMENTATION; SCHEDULING JOBS; SPEED ALGORITHMS;

ALGORITHMS;

EID: 35248834195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_24     Document Type: Article

References (15)

1. B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing, pages 198-205, 1999.
2. N. Bansal and K. Dhamdhere. Minimizing weighted flow time. In 14h Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
3. L. Becchetti and S. Leonardi. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. In ACM Symposium on Theory of Computing (STOC), pages 94-103, 2001.
4. L. Becchetti, S. Leonardi, and S. Muthukrishnan. Scheduling to minimize average stretch without migration. In Symposium on Discrete Algorithms, pages 548-557, 2000.
5. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk R. Pruhs. Online weighted flow time and deadline scheduling. Lecture Notes in Computer Science, 2129:36-47, 2001.
6. M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 270-279, 1998.
7. M. Bender, S. Muthukrishnan, and R. Rajaraman. Improved algorithms for stretch scheduling. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
8. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In ACM Symposium on Theory of Computing (STOC), 2001.
9. M. Crovella, R. Frangioso, and M. Harchol-Balter. Connection scheduling in web servers. In USENIX Symposium on Internet Technologies and Systems, 1999.
10. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
11. Bala Kalyanasundaram and Kirk Pruhs. Minimizing flow time nonclairvoyantly. In IEEE Symposium on Foundations of Computer Science, pages 345-352, 1997.
12. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoretical Computer Science, 130(1):17-47, 1994.
13. S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke. Online scheduling to minimize average stretch. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 433-442, 1999.
14. A. Silberschatz and P. Galvin. Operating System Concepts. Addison-Wesley, 5th Edition, 1998.
15. H. Zhu, B. Smith, and T. Yang. Scheduling optimization for resource-intensive web requests on server clusters. In ACM Symposium on Parallel Algorithms and Architectures, pages 13-22, 1999.