Asymptotic convergence of scheduling policies with respect to slowdown

Performance Evaluation

Volumn 49, Issue 1-4, 2002, Pages 241-256

  Harchol Balter, Mor ^a   Sigman, Karl ^b   Wierman, Adam ^a  

^a Carnegie Mellon University   (United States)

^b Department of Industrial Engineering ^*  (United States)

Author keywords

Conservation; Convergence; Large jobs; Processor sharing; Scheduling; Shortest remaining processing time

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA; MULTIPROCESSING SYSTEMS; SCHEDULING;

LARGE JOBS; PROCESSOR SHARING; SHORTEST REMAINING PROCESSING TIME;

QUEUEING NETWORKS;

EID: 1642285221     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(02)00132-3     Document Type: Conference Paper

References (27)

1. Baily, Foster, Hoang, Jette, Klingner, Kramer, Macaluso, Messina, Nielsen, Reed, Rudolph, Smith, Tomkins, Towns, Vildibill, Valuation of ultra-scale computing systems, White Paper, 1999.
2. N. Bansal, M. Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, in: Proceedings of Sigmetrics'01, 2001.
3. M. Bender, S. Chakrabarti, S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, in: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.
4. L. Cherkasova, Scheduling strategies to improve response time for web applications, in: High-performance Computing and Networking: International Conference and Exhibition, 1998, pp. 305-314.
5. Coffman E.G., Kleinrock L., Computer scheduling methods and their counter measures. AFIPS Conf. Proc. 32:1968;11-21.
6. R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, MA, 1967.
7. A.B. Downey, A parallel workload model and its implications for processor allocation, in: Proceedings of High Performance Distributed Computing, August 1997, pp. 112-123.
8. K. Sigman (Guest Editor), Special volume on queues with heavy-tailed distribution, QUESTA 33 (1999).
9. J.E. Gehrke, S. Muthukrishnan, R. Rajaraman, A. Shaheen, Scheduling to minimize average stretch online, in: Proceedings of the 40th Annual Symposium on Foundation of Computer Science, 1999, pp. 433-422.
10. M. Harchol-Balter, A. Downey, Exploiting process lifetime distributions for dynamic load balancing, ACM Trans. Comput. Syst. 15 (3) 1997.
11. L. Kleinrock, Communication Nets, McGraw-Hill, New York, 1964.
12. L. Kleinrock, Queueing Systems, Vol. II, Computer Applications, Wiley, New York, 1976.
13. M. Crovella, M. Harchol-Balter, S. Park, The case for SRPT schduling in web servers, Technical Report MIT-LCS-TR-767, MIT Lab for Computer Science, October 1998.
14. E. Modiano, Scheduling algorithms for message transmission over a satellite broadcast system, in: Proceedings of IEEE MILCOM'97, 1997, pp. 628-634.
15. Pechinkin A.V., Solovyev A.D., Yashkov S.F., A system with servicing discipline whereby the order of remaining length is serviced first. Tekhnicheskaya Kibernetika. 17:1979;51-59.
16. Perera R., The variance of delay time in queueing system M/G/1 with optimal strategy SRPT. Archiv für Elektronik und Übertragungstechnik. 47:1993;110-114.
17. M. Pinedo, On-line Algorithms, Lecture Notes in Computer Science, Prentice-Hall, Englewood Cliffs, NJ, 1995.
18. J. Roberts, L. Massoulie, Bandwidth sharing and admission control for elastic traffic, in: Proceedings of the ITC Specialist Seminar, 1998.
19. Schassberger R., The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time. Adv. Appl. Prob. 22:1990;456-479.
20. Schrage L.E., A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16:1968;678-690.
21. Schrage L.E., Miller L.W., The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14:1966;670-684.
22. Schreiber F., Properties and applications of the optimal queueing strategy SRPT - a survey. Archiv für Elektronik und Übertragungstechnik. 47:1993;372-378.
23. A. Silberschatz, P. Galvin, Operating System Concepts, 5th Edition, Wiley, New York, 1998.
24. Smith D.R., A new proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 26:1976;197-199.
25. W. Stallings, Operating Systems, 2nd Edition, Prentice-Hall, Englewood Cliffs, NJ, 1995.
26. A.S. Tanenbaum, Modern Operating Systems, Prentice-Hall, Englewood Cliffs, NJ, 1992.
27. R.W. Wolff, Stochastic Modeling and the Theory of Queues, Prentice-Hall, Englewood Cliffs, NJ, 1989.