Preventing Large Sojourn Times Using SMART Scheduling

References

• Aalto S., Ayesta U., Nyberg-Oksanen E. Two-level processor-sharing scheduling disciplines: Mean delay analysis. Proc. ACM Sigmetrics-Performance (2004) Crossref, Google Scholar
• Abate J., Whitt W. Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Systems (1997) 25:173–233Crossref, Google Scholar
• Asmussen S.Applied Probability and Queues (2003) 2nd ed.(Springer, New York) Google Scholar
• Barford P., Crovella M. Generating representative Web workloads for network and server performance evaluation. Proc. ACM Sigmetrics (1998) Crossref, Google Scholar
• Borst S., Núñez Queija R., Zwart B. Sojourn time asymptotics in processor sharing queues. Queueing Systems (2006) 53:31–51Crossref, Google Scholar
• Borst S., Boxma O., Núñez Queija R., Zwart B. The impact of the service discipline on delay asymptotics. Performance Eval. (2003) 54:175–206Crossref, Google Scholar
• Cherkasova L. Scheduling strategies to improve response time for Web applications. High-Performance Comput. Networking: Internat. Conf. Exhibition (1998) 305–314Crossref, Google Scholar
• Downey A. Evidence for long-tailed distributions in the Internet. Proc. ACM SIGCOMM Internet Measurement Workshop (2001) Crossref, Google Scholar
• Guillemin F., Robert Ph., Zwart B. Tail asymptotics for processor sharing queues. Adv. Appl. Probab. (2004) 36:525–543Crossref, Google Scholar
• Harchol-Balter M., Schroeder B., Bansal N., Agrawal M. Implementation of SRPT scheduling in Web servers. ACM Trans. Comput. Systems (2003) 21(2):207–233Crossref, Google Scholar
• Jelenkovic P., Momcilovic P. Large deviation analysis of subexponential waiting times in a processor sharing queue. Math. Oper. Res. (2003) 28:587–608Link, Google Scholar
• Leland W., Taqqu M., Willinger W., Wilson D. On the self-similar nature of Ethernet traffic. Proc. SIGCOMM '93 (1993) 183–193Crossref, Google Scholar
• Mandjes M., Nuyens M. Sojourn times in the M/G/1 FB queue with light-tailed service times. Probab. Engrg. Informational Sci. (2005) 19:351–361Crossref, Google Scholar
• Mandjes M., Zwart B. Large deviations for waiting times in processor sharing queues. Queueing Systems (2006) 52:237–250Crossref, Google Scholar
• McWherter D., Schroeder B., Ailamaki N., Harchol-Balter M. Priority mechanisms for OLTP and transactional Web applications. Internat. Conf. Data Engrg. (2004) Crossref, Google Scholar
• Núñez Queija R. Queues with equally heavy sojourn time and service requirement distributions. Ann. Oper. Res. (2002) 113:101–117Crossref, Google Scholar
• Nuyens M. The foreground-background queue. (2004) . Ph.D. thesis, University of Amsterdam, AmsterdamGoogle Scholar
• Nuyens M., Zwart B. A large-deviations analysis of the GI/GI/1 SRPT queue. Queueing Systems (2006) 54:85–97Crossref, Google Scholar
• Peterson D. Data center I/O patterns and power laws. CMG Proc. (1996) Google Scholar
• Rai I., Urvoy-Keller G., Vernon M., Biersack E. Performance modeling of LAS based scheduling in packet switched networks. Proc. ACM Sigmetrics-Performance (2004) Google Scholar
• Rawat M., Kshemkalyani A. SWIFT: Scheduling in Web servers for fast response time. Sympos. Network Comput. Appl. (2003) Google Scholar
• Resnick S., Samorodnitsky G. Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues. Queueing Systems (1999) 33:43–71Crossref, Google Scholar
• Righter R., Shanthikumar J. Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probab. Engrg. Informational Sci. (1989) 3:323–333Crossref, Google Scholar
• Righter R., Shanthikumar J. Extremal properties of the FIFO discipline in queueing networks. J. Appl. Probab. (1992) 29:967–978Crossref, Google Scholar
• Wierman A., Harchol-Balter M. Classifying scheduling policies with respect to unfairness in an M/GI/1. Proc. ACM Sigmetrics (2003) Crossref, Google Scholar
• Wierman A., Harchol-Balter M. Classifying scheduling policies with respect to higher moments of conditional response time. Proc. ACM Sigmetrics (2005) Crossref, Google Scholar
• Wierman A., Harchol-Balter M., Osogami T. Nearly insensitive bounds for SMART scheduling. Proc. ACM Sigmetrics (2005) Crossref, Google Scholar
• Wolff R.Stochastic Modeling and the Theory of Queues (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Yang S., de Veciana G. Enhancing both network and user performance for networks supporting best effort traffic. Trans. Networking (2004) 12:349–360Crossref, Google Scholar