Non-clairvoyant scheduling for minimizing mean slowdown

Algorithmica (New York)

Volumn 40, Issue 4, 2004, Pages 305-318

  Bansal, Nikhil ^a   Dhamdhere, Kedar ^a   Könemann, Jochen ^b   Sinha, Amitabh ^b  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Non clairvoyant algorithms; Online algorithms; Resource augmentation; Scheduling; Slowdown

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION;

NON-CLAIRVOYANT ALGORITHMS; ONLINE ALGORITHMS; RESOURCE AUGMENTATION; SLOWDOWN;

SCHEDULING;

EID: 21044447394     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1115-0     Document Type: Conference Paper

References (16)

1. B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In Proceedings of the ACM Symposium on Theory of Computing, pages 198-205, 1999.
2. N. Bansal and K. Dhamdhere. Minimizing weighted flow time. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 508-516, 2003.
3. L. Becchetti and S. Leonardi. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 94-103, 2001.
4. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, and K. R. Pruhs. Online weighted flow time and deadline scheduling. In RANDOM - APPROX, M. X. Goemans, K. Jansen, J. D. P. Rolim, and L. Trevisan (eds.), pages 36-47. Lecture Notes in Computer Science, 2129. Springer-Verlag, Berlin, 2001.
5. L. Becchetti, S. Leonardi, and S. Muthukrishnan. Scheduling to minimize average stretch without migration. In Proceedings of the Symposium on Discrete Algorithms, pages 548-557, 2000.
6. M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 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 Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 762-771, 2002.
8. A. Borodin and R. El-Yaniv. On-Line Computation and Competitive Analysis. Cambridge University Press, Cambridge, 1998.
9. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 84-93, 2001.
10. M. Crovella, R. Frangioso, and M. Harchol-Balter. Connection scheduling in web servers. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, pages 243-254, 1999.
11. B. Kalyanasundaram and K. Pruhs. Minimizing flow time nonclairvoyantly. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 345-352, 1997.
12. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
13. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoretical Computer Science, 130(1): 17-47, 1994.
14. S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke. Online scheduling to minimize average stretch. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 433-442, 1999.
15. W. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
16. H. Zhu, B. Smith, and T. Yang. Scheduling optimization for resource-intensive web requests on server clusters. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures. pages 13-22, 1999.