Tail equivalence for some time-shared systems

Many of recent studies have proved the tail equivalence result for Egalitarian Processor Sharing system: [EQUATION], where B (resp. V) is service requirement (resp. sojourn time) of a customer; for PS, g = 1 - ρ. In this paper, we consider time-shared systems in which the server capacity is shared by existing customers in proportion to (dynamic) weights assigned to customers. We consider two systems, 1) in which the weight of a customer depends on it Age (attained service), and 2) in which the weight depends on the residual processing time (RPT). We allow for a parameterized family of weight functions such that the weight associated with a customer that has received a service (or, has a RPT) of x units is ω(x) = xα for some -∞ < α < ∞. We then study the sojourn time of a customer under such scheduling discipline and provide conditions on α for tail equivalence to hold true, and also give the value of g as a function of α.

[1]  J. George Shanthikumar,et al.  Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures , 1989, Probability in the Engineering and Informational Sciences.

[2]  Sem C. Borst,et al.  Sojourn time asymptotics in processor-sharing queues , 2006, Queueing Syst. Theory Appl..

[3]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.

[4]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[5]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[6]  李幼升,et al.  Ph , 1989 .

[7]  Fabrice Guillemin,et al.  Tail asymptotics for processor-sharing queues , 2004, Advances in Applied Probability.

[8]  Sem C. Borst,et al.  The impact of the service discipline on delay asymptotics , 2003, Perform. Evaluation.

[9]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[10]  A. P. Zwart,et al.  Sojourn time asymptotics in the M/G/1 processor sharing queue , 1998, Queueing Syst. Theory Appl..

[11]  J. Teugels,et al.  On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1 , 1980, Journal of Applied Probability.

[12]  Adam Wierman,et al.  Asymptotic convergence of scheduling policies with respect to slowdown , 2002, Perform. Evaluation.

[13]  Sanjay Shakkottai,et al.  Asymptotic Evaluation of Delay in the SRPT Scheduler , 2006, IEEE Transactions on Automatic Control.

[14]  R. Núñez Queija,et al.  Discriminatory processor sharing revisited , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Leonard Kleinrock,et al.  Time-shared Systems: a theoretical treatment , 1967, JACM.

[16]  Guillaume Urvoy-Keller,et al.  Performance analysis of LAS-based scheduling disciplines in a packet switched network , 2004, SIGMETRICS '04/Performance '04.

[17]  Predrag R. Jelenkovic,et al.  Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue , 2003, Math. Oper. Res..

[18]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[19]  R. Núñez Queija,et al.  TCP as an Implementation of Age-Based Scheduling: Fairness and Performance , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[20]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[21]  Anurag Kumar,et al.  Stochastic models for throughput analysis of randomly arriving elastic flows in the Internet , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[22]  Rudesindo Núñez-Queija,et al.  Queues with Equally Heavy Sojourn Time and Service Requirement Distributions , 2002 .