Many flows asymptotics for SMART scheduling policies

IEEE Transactions on Automatic Control

Volumn 57, Issue 2, 2012, Pages 376-391

  Yang, Changwoo ^a   Wierman, Adam ^b   Shakkottai, Sanjay ^c   Harchol Balter, Mor ^d  

^a QUALCOMM INC   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c The University of Texas at Austin   (United States)

^d Carnegie Mellon University   (United States)

Author keywords

Foreground background (FB); many sources large deviation; shortest remaining processing time (SRPT); two dimensional (2 D) queueing

Indexed keywords

ASYMPTOTICS; DECAY RATE; DELAY DISTRIBUTIONS; DISCRETE-TIME QUEUEING SYSTEM; FIRST COME FIRST SERVES; FOREGROUND-BACKGROUND (FB); LARGE DEVIATIONS; MANY SOURCES LARGE DEVIATION; MEAN DELAYS; PROCESSOR SHARING; SCHEDULING POLICIES; SHORTEST REMAINING PROCESSING TIME; TOTAL ORDERING; TWO-DIMENSIONAL (2-D) QUEUEING; VIRTUAL QUEUE;

DECAY (ORGANIC); SCHEDULING; TWO DIMENSIONAL;

QUEUEING THEORY;

EID: 84863073751     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2011.2173418     Document Type: Article

References (35)

1. M. F. Arlitt and C. L. Williamson, "Internet web servers: Workload characterization and performance implications," IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 631-645, Oct. 1997.
2. S. C. Borst, O. J. Boxma, R. Nunez-Queija, and B. Zwart, "The impact of the service discipline on delay asymptotics," Performance Evaluation, vol. 54, no. 2, pp. 175-206, Oct. 2003.
3. D. Botvich and N. Duffield, "Large deviations, economies of scale, and the shape of the loss curve in large multiplexers," Queueing Syst., vol. 20, pp. 293-320, 1995.
4. M. E. Crovella and A. Bestavros, "Self-similarity in world wide web traffic: Evidence and possible causes," IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 835-846, Dec. 1997.
5. S. Delas, R. Mazumdar, and C. Rosenberg, "Cell loss asymptotics for buffers handling a large number of independent stationary sources," in Proc. IEEE Infocom., Mar. 1999, pp. 551-558.
6. S. Delas, R. Mazumdar, and C. Rosenberg, "Tail asymptotics for hol priority queues handling a large number of independent stationary sources," Queue. Syst. Theor. Appl., vol. 40, no. 2, pp. 183-204, 2002.
7. H. Feng, V. Misra, and D. Rubenstein, "PBS: A unified priority-based CPU scheduler," Columbia Univ., New York, NY, Tech. Rep., 2006, pp. 1-23.
8. M. Harchol-Balter, B. Schroeder, N. Bansal, and M. Agrawal, "Implementation of SRPT scheduling in web servers," ACM Trans. Comp. Syst., vol. 21, no. 2, May 2003, Tech. Rep. CMO-CS-00-170.
9. M. Hu, J. Zhang, and J. Sadowsky, "A size-aided opportunistic scheduling scheme in wireless networks," in Proc. Globecom., 2003, pp. 538-542.
10. C. Kotopoulos, N. Likhanov, and R. Mazumdar, "Overflow asymptotics in GPS systems with heterogeneous longtailed inputs," in Proc. IEEE Infocom., 2001, pp. 299-308.
11. N. Likhanov and R. Mazumdar, "Cell loss asymptotics for buffers fed with a large number of independent stationary sources," J. Appl. Prob., vol. 36, pp. 86-96, 1999.
12. D. Lu, P. Dinda, Y. Qiao, and H. Sheng, "Effects and implications of file size/service time correlation on web server scheduling policies," in Proc. IEEE Mascots, 2005, pp. 258-267.
13. M. Mandjes and M. Nuyens, "Sojourn time in the M/G/1 FB queue with light-tailed service times," Prob. Eng. Info. Sci., vol. 19, pp. 351-361, 2005.
14. R. Nunez-Queija, "Queues with equally heavy sojourn time and service requirement distributions," Annu. Oper. Res., vol. 113, pp. 101-117, 2002.
15. M. Nuyens, "The Foreground-Background Queue," Ph.D. dissertation, Univ. of Amsterdam, Amsterdam, The Netherlands, 2004.
16. M. Nuyens and A. Wierman, "The foreground-background queue: A survey," Performance Evaluation, vol. 65, no. 3-4, pp. 286-307, 2008.
17. M. Nuyens, A.Wierman, and B. Zwart, "Preventing large sojourn times using SMART scheduling," Operations Research, vol. 56, no. 1, pp. 88-101, 2008.
18. M. Nuyens and B. Zwart, "A large-deviation analysis of the GI/GI/1 SRPT queue," Queueing Syst., vol. 54, no. 2, pp. 85-97, 2006.
19. Y. Qiao, D. Lu, R. Bustamante, and P. Dinda, Looking at the Server Side of Peer-to-Peer Systems Northwestern Univ., Boston, MA, Tech. Rep. NWU-CS-04-37, 2004.
20. I. Rai, G. Urvoy-Keller, and E. Biersack, "Analysis of LAS scheduling for job size distributions with high variance," in Proc. ACMSigmetrics, 2003, pp. 1-11.
21. I. Rai, G. Urvoy-Keller, M. Vernon, and E. Biersack, "Performance modeling of LAS based scheduling in packet switched networks," in Proc. ACM Sigmetrics/Performance, 2004, pp. 1-12.
22. M. Rawat and A. Kshemkalyani, "SWIFT: Scheduling in web servers for fast response time," in Proc. Symp. Netw. Comp. Appl., 2003, pp. 51-58.
23. R. Righter and J. Shanthikumar, "Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures," Prob. Eng. Info. Sci., vol. 3, pp. 967-978, 1989.
24. R. Righter, J. Shanthikumar, and G. Yamazaki, "On external service disciplines in single stage queueing systems," J. Appl. Prob., vol. 27, pp. 409-416, 1990.
25. L. E. Schrage, "A proof of the optimality of the shortest remaining processing time discipline," Operations Research, vol. 16, pp. 678-690, 1968.
26. B. Schroeder and M. Harchol-Balter, "Web servers under overload: How scheduling can help," ACM Trans. Internet Technol., vol. 6, no. 1, pp. 20-52, 2006.
27. A. Schwartz and A. Weiss, Large Deviations for Performance Analysis. London, U.K.: Chapman and Hall, 1995.
28. S. Shakkottai and R. Srikant, "Many-sources delay asymptotics with applications to priority queues," Queueing Syst.: Theor. Appl., vol. 39, pp. 183-200, Oct. 2001.
29. A. Wierman, "Fairness and classifications," Performance Eval. Rev., vol. 34, no. 4, pp. 4-12, 2007.
30. A. Wierman, "Scheduling for Today's Computer Systems: Bridging Theory and Practice," Ph.D. dissertation, Carnegie Mellon Univ., Pittsburgh, PA, 2007.
31. A. Wierman and M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1," in Proc. ACM Sigmetrics, 2003, pp. 238-249.
32. A. Wierman, M. Harchol-Balter, and T. Osogami, "Nearly insensitive bounds on SMART scheduling," in Proc. ACM Sigmetrics, 2005, pp. 205-216.
33. C. Yang and S. Shakkottai, "A discrete version of processor sharing accessed by a large number of flows," Performance Evaluation, submitted for publication.
34. C. Yang and S. Shakkottai, "Asymptotic evaluation of delay with the SRPT scheduler," IEEE Trans. Autom. Control, vol. 51, no. 11, pp. 1848-1854, Nov. 2006.
35. C. Yang, A. Wierman, S. Shakkottai, and M. Harchol-Balter, "Tail asymptotics for policies favoring short jobs in a many-flows regime," in Proc. ACM Sigmetrics, 2006, pp. 99-108.