Steady-State Analysis for Multiserver Queues Under Size Interval Task Assignment in the Quality-Driven Regime

References

• Asmussen S. Applied Probability and Queues (2003) (Springer, New York) Google Scholar
• Bachmat E, Sarfati H. Analysis of SITA policies. Performance Evaluation (2010) 67(2):102–120Crossref, Google Scholar
• Blanchet J, Glynn P, Lam H. Rare event simulation for a slotted time M/G/s model. Queueing System Theory Appl. (2009) 63(1):33–57Crossref, Google Scholar
• Cardellini V, Casalicchio E, Colajanni M, Yu PS. The state of the art in locally distributed web-server systems. ACM Comput. Surveys (2002) 34(2):263–311Crossref, Google Scholar
• Ciardo G, Riska A, Smirni E. Equiload: A load balancing policy for clustered web servers. Performance Evaluation (2001) 46(2–3):46–101Crossref, Google Scholar
• Embrechts P, Klüppelberg C, Mikosch T. Modelling Extremal Events: For Insurance and Finance (Stochastic Modelling and Applied Probability) (2008) (Springer, New York) Google Scholar
• Finkenstadt B, Rootzen H. Extreme Values in Finance, Telecommunications, and the Environment (2004) (CRC Press LLC, Boca Raton, FL) Google Scholar
• Gamarnik D, Goldberg D. Steady-state GI/GI/N queue in the Halfin-Whitt regime. (2012) . http://arxiv.org/abs/1103.1709Google Scholar
• Gamarnik D, Momčilović P. Steady-state analysis of a multiserver queue in the Halfin-Whitt regime. Adv. Appl. Probab. (2008) 40(2):548–577Crossref, Google Scholar
• Ganesh A, O'Connell N, Wischik D. Big Queues (2004) (Springer-Verlag, Berlin, Heidelberg) Crossref, Google Scholar
• Garnett O, Mandelbaum A, Reiman M. Designing a call center with impatient customers. Manufacturing Service Oper. Management (2002) 4(3):208–227Link, Google Scholar
• Graham RL, Grötschel M, Lovász L. Handbook of Combinatorics (2003) (The MIT Press, Cambridge, MA) Google Scholar
• Gross D, Harris CM. Fundamentals of Queueing Theory (1998) 3rd ed.(Wiley-Interscience, New York) Google Scholar
• Harchol-Balter M. Queueing disciplines. Wiley Encyclopedia of Operations Research and Management Science (2009) (John Wiley & Sons, Hoboken, NJ) Google Scholar
• Harchol-Balter M, Crovella ME, Murta CD. On choosing a task assignment policy for a distributed server system. J. Parallel and Distributed Comput. (1999) 59(2):204–228Crossref, Google Scholar
• Harchol-Balter M, Scheller-Wolf A, Young A. Surprising results on task assignment in server farms with high-variability workloads. Proc. ACM SIGMETRICS 2009 Conf. Measurement and Modeling Comput. Systems (2009a) Seattle, WA(ACM, New York) Crossref, Google Scholar
• Harchol-Balter M, Scheller-Wolf A, Young A. Why segregating short jobs from long jobs under high variability is not always a win. 47th Annual Allerton Conf. Comm., Control, Comput. (2009b) (IEEE, Piscataway, NJ) 102–120Crossref, Google Scholar
• Jelenković P, Mandelbaum A, Momčilović P. Heavy traffic limits for queues with many deterministic servers. Queueing System Theory Appl. (2004) 47(1/2):53–69Crossref, Google Scholar
• Kingman JFC. The first Erlang century–and the next. Queueing System Theory Appl. (2009) 63(1):3–12Crossref, Google Scholar
• Liu H, Wee S. Web server farm in the cloud: Performance evaluation and dynamic architecture. Cloud Computing (2009) 5931(Springer-Verlag, Berlin, Heidelberg) 369–380Crossref, Google Scholar
• López-Ortiz A. Valiant load balancing, capacity provisioning and resilient backbone design. Combinatorial and Algorithmic Aspects of Networking (2007) 4852(Springer-Verlag, Berlin, Heidelberg) 3–12Crossref, Google Scholar
• Nuyens M, Wierman A, Zwart B. Preventing large sojourn times using SMART scheduling. Oper. Res. (2008) 56(1):88–101Link, Google Scholar
• Pang G, Whitt W. Service interruptions in large-scale service systems. Management Sci. (2009) 55(9):1499–1512Link, Google Scholar
• Schroeder B, Harchol-Balter M. Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness. Cluster Comput. (2004) 7(2):151–161Crossref, Google Scholar
• Smith DR, Whitt W. Resource sharing for efficiency in traffic systems. Bell System Tech. J. (1981) 60(1):39–55Crossref, Google Scholar
• Stanley RP. Enumerative Combinatorics (2000) 12nd ed.(Cambridge University Press, New York) Google Scholar
• Tezcan T, Dai JG. Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. (2010) 58(1):94–110Link, Google Scholar
• Tijms HC. Stochastic Models: An Algorithmic Approach (1995) (John Wiley & Sons, New York) Google Scholar
• Tijms HC, Van Hoorn MH, Federgruen A. Approximations for the steady-state probabilities in the M/G/c queue. Adv. Appl. Probab. (1981) 13(1):186–206Crossref, Google Scholar
• Wang C, Wolff RW. The M/G/c queue in light traffic. Queueing System Theory Appl. (1998) 29(1):17–34Crossref, Google Scholar
• Whitt W. The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution. Queueing System Theory Appl. (2000) 36(1–3):71–87Crossref, Google Scholar
• Whitt W. The Erlang B and C formulas: Problems and solutions. (2002) . Class notes, http://www.columbia.edu/~ww2040/ErlangBandCFormulas.pdfGoogle Scholar
• Wierman A, Zwart B. Is tail-optimal scheduling possible? Oper. Res. (2012) 60(5):1249–1257Link, Google Scholar
• Yang CW, Wierman A, Shakkottai S, Harchol-Balter M. Many flows asymptotics for SMART scheduling policies. IEEE Trans. Automated Control (2012) 57(2):376–391Crossref, Google Scholar
• Yao DD. Refining the diffusion approximation for the M/G/m queue. Oper. Res. (1985) 33(6):1266–1277Link, Google Scholar
• Zeltyn S, Mandelbaum A. Call centers with impatient customers: Many-server asymptotics of the M/M/n + G queue. Queueing System Theory Appl. (2005) 51(3–4):361–402Crossref, Google Scholar