Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals

Abstract Avrachenkov et al. (Queueing Syst. 50:459–480, [2005]) conjectured that in an M/G/1 processor-sharing queue with batch arrivals, the conditional mean sojourn time is concave. In this paper, we show that this conjecture is generally not true.

[1]  Bhaskar Sengupta,et al.  An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue , 1992 .

[2]  F. G. Foster,et al.  Conditional response times in the M / G /1 processor-sharing system , 1983 .

[3]  V. Ramaswami.  THE SOJOURN TIME IN THE GI/M/1 QUEUE , 1984 .

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

[5]  K. Charles.  Asymptotic approximations for the GI/M/1 queue with processor-sharing service , 1992 .

[6]  Leonard Kleinrock,et al.  The processor-sharing queueing model for time-shared systems with bulk arrivals , 1971, Networks.

[7]  Kiran M. Rege,et al.  The M/G/1 Processor-Sharing Queue with Bulk Arrivals , 1993, Modelling and Evaluation of ATM Networks.

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

[9]  T. Ott.  THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .

[10]  Tetsuya Takine,et al.  Sojourn time distribution in a MAP/M/1 processor-sharing queue , 2003, Oper. Res. Lett..

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

[12]  Konstantin Avrachenkov,et al.  Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling , 2005, Queueing Syst. Theory Appl..

[13]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

[14]  Vishal Misra,et al.  Asymptotic bounds for $M^X/G/1$ processor sharing queues , 2004 .

[15]  Bara Kim,et al.  The processor-sharing queue with bulk arrivals and phase-type services , 2007, Perform. Evaluation.

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

[17]  David L. Jagerman,et al.  The gi/m/1 processor-sharing queue and its heavy traffic analysis , 1991 .

[18]  Nikhil Bansal.  Analysis of the M/G/1 processor-sharing queue with bulk arrivals , 2003, Oper. Res. Lett..