On the equivalence between multiclass processor sharing and random order scheduling policies

Consider a single server system serving a multiclass population. Some popular scheduling policies for such system are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). In this paper, we propose two classes of policies, namely MPS (multiclass processor sharing) and MROS (multiclass random order service), that generalize the four policies mentioned above. For the special case when the multiclass population arrive according to Poisson processes and have independent and exponential service requirement with parameter ?, we show that the tail of the sojourn time distribution for a class i customer in a system with the MPS policy is a constant multiple of the tail of the waiting time distribution of a class i customer in a system with the MROS policy. This result implies that for a class i customer, the tail of the sojourn time distribution in a system with the DPS (GPS) scheduling policy is a constant multiple of the tail of the waiting time distribution in a system with the DROS (respectively WFQ) policy.

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

[2]  G. Fayolle,et al.  Two coupled processors: The reduction to a Riemann-Hilbert problem , 1979 .

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

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

[5]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[6]  T. Lindvall.  Lectures on the Coupling Method , 1992 .

[7]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[8]  John A. Morrison,et al.  Head of the line processor sharing for many symmetric queues with finite capacity , 1993, Queueing Syst. Theory Appl..

[9]  Zhi-Li Zhang,et al.  Statistical analysis of generalized processor sharing scheduling discipline , 1994, IEEE J. Sel. Areas Commun..

[10]  van der J Jan Wal,et al.  Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities , 1997, Probability in the Engineering and Informational Sciences.

[11]  Sem C. Borst,et al.  The equivalence between processor sharing and service in random order , 2003, Oper. Res. Lett..

[12]  Bara Kim,et al.  Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing , 2004, Perform. Evaluation.

[13]  D. Manjunath,et al.  Communication Networking: An Analytical Approach , 2004 .

[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]  Eitan Altman,et al.  A survey on discriminatory processor sharing , 2006, Queueing Syst. Theory Appl..

[16]  Moshe Haviv,et al.  Waiting times in queues with relative priorities , 2007, Oper. Res. Lett..

[17]  Sem C. Borst,et al.  Beyond processor sharing , 2007, PERV.

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

[19]  Moshe Haviv,et al.  Mean sojourn times for phase-type discriminatory processor sharing systems , 2008, Eur. J. Oper. Res..

[20]  Bara Kim,et al.  Analysis of the M/G/1 queue with discriminatory random order service policy , 2011, Perform. Evaluation.