Server scheduling in the Lpnorm: A rising tide lifts all boat

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 242-250

  Bansal, Nikhil ^a   Pruhs, Kirk ^b  

^a Carnegie Mellon University   (United States)

^b University of Pittsburgh   (United States)

Author keywords

Flow time; Multilevel feedback; Resource augmentation; Scheduling; Shortest elapsed time first; Shortest job first; Shortest remaining processing time

Indexed keywords

ALGORITHMS; MULTIPROCESSING PROGRAMS; QUALITY OF SERVICE; SCHEDULING; SERVERS; ROUTERS;

RESOURCE AUGMENTATION;

COMPUTATION THEORY; SCHEDULING;

FLOW-TIME; LP-NORM; MULTILEVEL FEEDBACK; MULTILEVELS; QUALITY-OF-SERVICE; RESOURCE AUGMENTATION; SERVER SCHEDULING; SHORT ELAPSED TIME FIRST; SHORT JOB FIRST; SHORTEST REMAINING PROCESSING TIME;

EID: 0038107694     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. N. Alon, Y. Azar, G. Woeginger, and T. Yadid. Approximation schemes for scheduling. In ACM-SIAM Symposium on Discrete Algorithms, pages 493-500, 1997.
2. p norm. Algorithmica, 29(3):422-441, 2001.
3. p norm. In IEEE Symposium on Foundations of Computer Science, 1995.
4. N. Bansal and K. Dhamdhere. Minimizing weighted flow time. In Symposium on Discrete Algorithms SODA, pages 508-516, 2003.
5. N. Bansal, K. Dhamdhere, J. Konemann, and A. Sinha. Non-clairvoyant scheduling for minimizing mean slowdown. In Symposium on Theoretical Aspects of Computer Science (STAGS), to appear, 2003.
6. N. Bansal and M. Harchol-Balter. Analysis of srpt scheduling: Investigating unfairness. In ACM Sigmetrics, pages 279-290, 2001.
7. 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.
8. L. Becchetti, S. Leonardi, A. M. Spaccamela, and K. Pruhs. Online weighted flow time and deadline scheduling. In RANDOM-APPROX, pages 36-47, 2001.
9. M. Bender, S. Muthukrishnan, and R. Rajaraman. Improved algorithms for stretch scheduling. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
10. A. Borodin and R. El-Yaniv. On-Line Computation and Competitive Analysis. Cambridge University Press, 1998.
11. C. Chekuri and S. Khanna. Approximation schemes for preemptive weighted flow time. In ACM Symposium on Theory of Computing (STOC), 2002.
12. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In ACM Symposium on Theory of Computing (STOC), 2001.
13. M. Crovella, R. Frangioso, and M. Harchol-Balter. Connection scheduling in web servers. In USENIX Symposium on Internet Technologies and Systems, pages 243-254, 1999.
14. J. Edmonds. Scheduling in the dark. Theoretical Computer Science, 235(1):109-141, 2000.
15. L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformly related and identical parallel machines. In European Symposium on Algorithms (ESA), pages 151-162, 1999.
16. M. Harchol-Balter, M. Crovella, and S. Park. The case for srpt scheduling of web servers.
17. http://httpd.apache.org/docs/.
18. http://www.netcraft.com/survey/.
19. B. Kalyanasundaram and K. Pruhs. Fault-tolerant scheduling. In STOC, 1994.
20. B. Kalyanasundaram and K. Pruhs. Minimizing flow time nonclairvoyantly. In IEEE Symposium on Foundations of Computer Science, pages 345-352, 1997.
21. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
22. D. Knuth. The TeXbook. Addison Wesley, 1986.
23. J. Kurose and K. Ross. Computer networking: A top-down approach featuring the Internet. Addison-Wesley, 2002.
24. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoretical Computer Science, 130(1):17-47, 1994.
25. 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.
26. C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. In ACM Symposium on Theory of Computing (STOC), pages 140-149, 1997.
27. B. Schroeder and M. Harchol-Balter. Web servers under overload: how scheduling can help.
28. A. Tanenbaum. Operating systems: design and implementation. Prentice-Hall, 2001.
29. K. Thompson. Unix implementation. The Bell System Technical Journal, 57(6):1931-1946, 1978.