Limited processor sharing queues and multi-server queues

[1]  Benjamin Avi-Itzhak,et al.  Expected Response Times in a Non-Symmetric Time Sharing Queue with a Limited Number of Service Positions , 1988 .

[2]  K. Ramanan,et al.  Fluid limits of many-server queues with reneging , 2010, 1011.2921.

[3]  Kai Lai Chung,et al.  A Course in Probability Theory , 1949 .

[4]  Lester Lipsky,et al.  An Analytical Model for Computer Systems with Non-Exponential Service Times and Memory Thrashing Overhead , 2007, PDPTA.

[5]  Kavita Ramanan,et al.  Law of large numbers limits for many-server queues , 2007, 0708.0952.

[6]  Ward Whitt,et al.  An Introduction to Stochastic-Process Limits and their Application to Queues , 2002 .

[7]  Hans-Ulrich Heiß,et al.  Adaptive Load Control in Transaction Processing Systems , 1991, VLDB.

[8]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[9]  Russ Blake,et al.  Optimal control of thrashing , 1982, SIGMETRICS '82.

[10]  Bert Zwart,et al.  Law of Large Number Limits of Limited Processor-Sharing Queues , 2009, Math. Oper. Res..

[11]  S. Shreve,et al.  Real-time queues in heavy traffic with earliest-deadline-first queue discipline , 2001 .

[12]  Anatolii A. Puhalskii,et al.  On many-server queues in heavy traffic , 2010, 1001.2163.

[13]  Alain Jean-Marie,et al.  On the transient behavior of the processor sharing queue , 1994, Queueing Syst. Theory Appl..

[14]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[15]  Ward Whitt,et al.  FLUID MODELS FOR MULTI-SERVER QUEUES WITH ABANDONMENTS , 2004 .

[16]  David Gamarnik,et al.  Steady-state analysis of a multiserver queue in the Halfin-Whitt regime , 2007, Advances in Applied Probability.

[17]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[18]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

[19]  Guodong Pang,et al.  Two-parameter heavy-traffic limits for infinite-server queues , 2008, Queueing Syst. Theory Appl..

[20]  Bert Zwart,et al.  Diffusion Limits of Limited Processor Sharing Queues , 2009, 0912.5306.

[21]  Amber L. Puha,et al.  Invariant states and rates of convergence for a critical fluid model of a processor sharing queue , 2004 .

[22]  Alexander L. Stolyar,et al.  The Fluid Limit of an Overloaded Processor Sharing Queue , 2006, Math. Oper. Res..

[23]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[24]  Jim Dai.  Stability of open multiclass queueing networks via fluid models , 1995 .

[25]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[26]  Mor Harchol-Balter,et al.  On the inapproximability of M/G/K: why two moments of job size distribution are not enough , 2010, Queueing Syst. Theory Appl..

[27]  Lester Lipsky,et al.  Modelling Restricted Processor Sharing , 2006, PDPTA.

[28]  Zeynep Akşin,et al.  The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research , 2007 .

[29]  P. Gänssler.  Weak Convergence and Empirical Processes - A. W. van der Vaart; J. A. Wellner. , 1997 .

[30]  D. Gamarnik,et al.  Validity of heavy traffic steady-state approximations in generalized Jackson networks , 2004, math/0410066.

[31]  Philippe Robert,et al.  Fluid Limits for Processor-Sharing Queues with Impatience , 2008, Math. Oper. Res..

[32]  Amarjit Budhiraja,et al.  Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic , 2009, Math. Oper. Res..

[33]  Ward Whitt,et al.  Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments , 2004, Manag. Sci..

[34]  Avishai Mandelbaum,et al.  Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime , 2008, Math. Oper. Res..

[35]  Avishai Mandelbaum,et al.  A model for rational abandonments from invisible queues , 2000, Queueing Syst. Theory Appl..

[36]  Tolga Tezcan,et al.  Many-server diffusion limits for G/Ph/n+GI queues , 2010, 1011.2034.

[37]  Sergei Grishechkin.  GI/G/1 processor sharing queue in heavy traffic , 1994, Advances in Applied Probability.

[38]  A. Krall.  Applied Analysis , 1986 .

[39]  Erich M. Nahum,et al.  A method for transparent admission control and request scheduling in e-commerce web sites , 2004, WWW '04.

[40]  Ken Thompson,et al.  The UNIX time-sharing system , 1974, CACM.

[41]  Predrag R. Jelenkovic,et al.  Heavy Traffic Limits for Queues with Many Deterministic Servers , 2004, Queueing Syst. Theory Appl..

[42]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[43]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.

[44]  Ward Whitt,et al.  Fluid Models for Multiserver Queues with Abandonments , 2006, Oper. Res..

[45]  Ronald W. Wolff,et al.  A Review of Regenerative Processes , 1993, SIAM Rev..

[46]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[47]  Amber L. Puha,et al.  THE FLUID LIMIT OF A HEAVILY LOADED PROCESSOR SHARING QUEUE , 2002 .

[48]  Erich M. Nahum,et al.  Yaksha: a self-tuning controller for managing the performance of 3-tiered Web sites , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[49]  Bert Zwart,et al.  Steady state approximations of limited processor sharing queues in heavy traffic , 2008, Queueing Syst. Theory Appl..

[50]  P. Spreij.  Probability and Measure , 1996 .

[51]  H. C. Gromoll.  Diffusion approximation for a processor sharing queue in heavy traffic , 2004, math/0405298.

[52]  Avishai Mandelbaum,et al.  Statistical Analysis of a Telephone Call , 2002 .

[53]  Avishai Mandelbaum,et al.  Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue , 2005, Queueing Syst. Theory Appl..

[54]  J. Reed,et al.  The G/GI/N queue in the Halfin–Whitt regime , 2009, 0912.2837.

[55]  Jon A. Wellner,et al.  Weak Convergence and Empirical Processes: With Applications to Statistics , 1996 .

[56]  Peter J. Denning,et al.  Optimal multiprogramming , 2004, Acta Informatica.

[57]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[58]  Adam Wierman,et al.  How to Determine a Good Multi-Programming Level for External Scheduling , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[59]  Lukasz Kruk,et al.  Heavy traffic limit for processor sharing queue with soft deadlines , 2007, 0707.4600.

[60]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .