Diffusion Limits of Limited Processor Sharing Queues

We consider a processor sharing queue where the number of jobs served at any time is limited to K, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this measure-valued process is obtained under diffusion scaling and heavy traffic conditions. As a consequence, the limit of the system size process is proved to be a piece-wise reflected Brownian motion. © Institute of Mathematical Statistics, 2011.

[1]  A. Retrospective,et al.  The UNIX Time-sharing System , 1977 .

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

[3]  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..

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

[5]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

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

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

[8]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

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

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

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

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

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

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

[15]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

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

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

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

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

[20]  B. Brunt,et al.  The Lebesgue-Stieltjes Integral: A Practical Introduction , 2000 .

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

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

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

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

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

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