Sojourn times in (discrete) time shared systems and their continuous time limits

We consider two classes of preemptive processor sharing scheduling policies in which the instantaneous weight given to a customer depends on a) the amount of service already imparted to the customer (Age-based scheduling), or b) the amount of service yet to be imparted to the customer (Residual Processing Time, RPT, based scheduling). We analyze the system for the mean sojourn time of a tagged customer conditioned on its service requirement. The main contribution of this article are:i) We decompose the sojourn time of a customer into two parts: a) the contribution of the descendants of the customer, and b) the contribution of the jobs (and their descendants) which the customer sees on arrival. For the preemptive system under consideration, it is shown that the behavior of the mean sojourn time for large values of service requirement is determined only by the first term above. We provide a closed form expression for this component of the sojourn time for general Age-based and RPT-based scheduling disciplines.iii) If the weight assigned to a customer with an age x units is xα for some α, we show that the behavior of mean sojourn time conditioned on service requirement is asymptotically linear for all 0 ≤ α ≤ 1. Moreover, this asymptotic slope is same for 0 ≤ α < 1 and shows a discontinuity at α = 1.

[1]  Isi Mitrani,et al.  Sharing a Processor Among Many Job Classes , 1980, JACM.

[2]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

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

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

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

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

[7]  Anurag Kumar,et al.  The lightening effect of adaptive window control , 2003, IEEE Communications Letters.

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

[9]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[10]  Vishal Misra,et al.  PBS: a unified priority-based scheduler , 2007, SIGMETRICS '07.

[11]  M.F.M. Nuijens.  The Foreground-Background Queue , 2004 .

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

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

[14]  Adam Wierman,et al.  The Foreground-Background queue: A survey , 2008, Perform. Evaluation.

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

[16]  Michel Mandjes,et al.  Large deviations of sojourn times in processor sharing queues , 2006, Queueing Syst. Theory Appl..

[17]  Ian H. Sloan,et al.  Quadrature methods for integral equations of the second kind over infinite intervals , 1981 .

[18]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[19]  R. Schassberger,et al.  A new approach to the M/G/1 processor-sharing queue , 1984, Advances in Applied Probability.

[20]  John S. Heidemann,et al.  Preferential treatment for short flows to reduce web latency , 2003, Comput. Networks.

[21]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[22]  J. Shanthikumar,et al.  On extremal service disciplines in single-stage queueing systems , 1990, Journal of Applied Probability.

[23]  Rolf Schassberger.  On the response time distribution in a discrete round-robin queue , 2004, Acta Informatica.

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

[25]  Arzad Alam Kherani,et al.  Tail equivalence for some time-shared systems , 2006, valuetools '06.

[26]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

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

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

[29]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .