Adaptive and scalable comparison scheduling

Performance Evaluation Review

Volumn 35, Issue 1, 2007, Pages 215-226

  Jelenkovic, Predrag R ^a   Kang, Xiaozhu ^a   Tan, Jian ^a  

^a Columbia University ^*  (United States)

Author keywords

Adaptive thresholds; Asymptotic analysis; Comparison scheduling; Foreground background processor sharing; Heavy tails; M G 1 queue; Medium size jobs; Processor sharing; Scalability; Shortest remaining processing time first

Indexed keywords

ADAPTIVE THRESHOLDS; COMPARISON SCHEDULING; HEAVY TAILS; MEAN VALUE ANALYSIS; MEDIUM SIZE JOBS; PROCESSOR SHARING; SHORTEST REMAINING PROCESSING TIME (SRPT);

ADAPTIVE SYSTEMS; ASYMPTOTIC ANALYSIS; COMPUTATIONAL COMPLEXITY; OPTIMAL SYSTEMS; SCALABILITY; SERVERS;

SCHEDULING;

EID: 36348950940     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1269899.1254907     Document Type: Conference Paper

References (32)

1. V. Anantharam. Scheduling strategies and long-range dependence. Queueing Syst. Theory Appl., 33(1/3):73-89, 1999.
2. S. Asmussen, H. Schmidli, and V. Schmidt. Tail probabilities for non-standard risk and queueing processes with subexponential jumps. Adv. in Appl. Probab., 31(2):422-447, 1999.
3. F. Baccelli and P. Bremaud. Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurence. Springer Verlag, 1994.
4. N. Bansal. On the average sojourn time under M/M/1/SRPT. Operations Research Letters, 33(2):195-200, 2005.
5. N. Bansal and D. Gamarnik. Handling load with less stress. Queueing Syst. Theory Appl., 54(1):45-54, 2006.
6. N. Bansal and M. Harchol-Balter. Analysis of SRPT scheduling: investigating unfairness. In ACM SIGMETRICS & Performance, pages 279-290, Cambridge, MA, 2001.
7. S. Borst, R., Núñez-Queija, and B. Zwart. Sojourn time asymptotics in processor-sharing queues. Queueing Syst. Theory Appl., 53(1-2):31-51, 2006.
8. S. C. Borst, O. J. Boxma, R., Núñez-Queija, and A. P. Zwart. The impact of the service discipline on delay asymptotics. Performance Evaluation, 54(2):175-206, 2003.
9. B. Caprita, J. Nieh, and C. Stein. Grouped distributed queues: Distributed queue, proportional share multiprocessor scheduling. Proceedings of the Twenty-fifth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2006), pages 72-81, July 23-26, 2006.
10. H. Feng, V. Misra, and D. Rubenstein. PBS: A unified priority-based CPU scheduler. Technical Report, Computer Science Department, Columbia University, 2006.
11. M. Harchol-Balter, B. Schroeder, N. Bansal, and M. Agrawal. Size-based scheduling to improve web performance. ACM Trans. Comput. Syst., 21(2):207-233, 2003.
12. P. R. Jelenković, X. Kang, and J. Tan. Adaptive and scalable comparison scheduling. Extended version. Technical Report, Department of Electrical Engineering, Columbia University, March 2007. http://www.ee.columbia. edu/~predrag/pub.list.html.
13. P. R. Jelenković, X. Kang, and J. Tan. Heavy-tailed limits for medium size jobs and comparison scheduling. Technical Report, No. EE2007-01-24, Department of Electrical Engineering, Columbia University, January 2007, submitted for publication.
14. P. R. Jelenković and A. A. Lazar. Subexponential asymptotics of a Markov-modulated random walk with queueing applications. J. Appl. Probab., 35(2):325-347, June 1998.
15. P. R. Jelenković and P. Moměilović. Capacity regions for network multiplexers with heavy-tailed fluid on-off sources. In Proc. IEEE Infocom, Anchorage, AK, April 2001.
16. P. R., Jelenković and P. Moměilović. Large deviation analysis of subexponential waiting times in a processor-sharing queue. Mathematics of Operations Research, 28(3):587-608, August 2003.
17. L. Kleinrock. Queueing Systems, vol. II. John Wiley and Sons, 1976.
18. R., M. Loynes. The stability of a queue with non-independent inter-arrival and service times. Proc. Cambridge Philos. Soc., 58:497-520, 1962.
19. M. Nuyens and A. Wierman. The foreground-background queue: a survey. Oct 2006, preprint.
20. M. Nuyens and B. Zwart. A large-deviations analysis of the GI/GI/1 SRPT queue. Queueing Syst. Theory Appl., 54(2):85-97, 2006.
21. A. Pakes. On the tails of waiting-time distributions. J. Appl. Probab., 12:555-564, 1975.
22. K. Park and W. Willinger, editors. Self-similar Network Traffic and Performance Evaluation. Wiley, New York, 2000.
23. I. A. Rai, E. W. Biersack, and G. Urvoy-Keller. Size-based scheduling to improve the performance of short TCP flows. IEEE Network, pages 12- 17, January/February 2005.
24. I. A. Rai, G. Urvoy-Keller, M. K. Vernon, and E. W. Biersack. Performance analysis of LAS-based scheduling disciplines in a packet switched network. In SIGMETRICS/Performance '04, pages 106-117, New York, NY, USA, 2004.
25. K. Ramanan and A. L. Stolyar. Largest weighted delay first scheduling: Large deviations and optimality. Annals of Applied Probability, 11(1):1-48, Feb 2001.
26. M. Rawat and A. Kshemkayani. SWIFT: Scheduling in web servers for fast response time. In Second IEEE International Symposium on Network Computing and Applications, April 2003.
27. L. E. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16(3):687-690, 1968.
28. L. E. Schrage and L. W. Miller. The queue M/G/1 with the shortest remaining processing time discipline. Operations Research, 14:670-684, 1966.
29. M. Squillante, D. Yao, and L. Zhang. Web traffic modeling and web server performance analysis. In Proc. IEEE 38th Conf., Decision and Control, pages 4432-4437, Phoenix, AZ, 1999.
30. A. Wierman and M. Harchol-Balter. Classifying scheduling policies with respect to unfairness in an M/GI/1. In ACM SIGMETRICS'03, pages 238-249, San Diego, CA, USA, 2003.
31. A. Wierman, M. Harchol-Balter, and T. Osogami. Nearly insensitive bounds on smart scheduling. In ACM SIGMETRICS'05, pages 205-216, Banff, Alberta, Canada, 2005.
32. R. W. Wolff. Stochastic Modeling and Theory of Queues. Prentice Hall, 1989.