Abstract
In this paper, we study a discriminatory processor sharing queue with Poisson arrivals,K classes and general service times. For this queue, we prove a decomposition theorem for the conditional sojourn time of a tagged customer given the service times and class affiliations of the customers present in the system when the tagged customer arrives. We show that this conditional sojourn time can be decomposed inton+1 components if there aren customers present when the tagged customer arrives. Further, we show that thesen+1 components can be obtained as a solution of a system of non-linear integral equations. These results generalize known results about theM/G/1 egalitarian processor sharing queue.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B.K. Asare and F.G. Foster, Conditional response time in theM/G/1 processor-sharing system, J. Appl. Probl. 20 (1983) 910–915.
E.G. Coffman, R.R. Muntz and H. Trotter, Waiting time distributions for processor-sharing systems, J. ACM 17 (1970) 123–130.
G. Fayolle, I. Mitrani and R. Iasnogorodski, Sharing a processor among many job classes, J. ACM 27 (1980) 519–532.
D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, Vol. 1 (McGraw-Hill, New York, 1982).
L. Kleinrock, Time-shared systems: A theoretical treatment, J. ACM 14 (1967) 242–261.
D. Mitra and A. Weiss, A closed network with a discriminatory processor-sharing server,1989 ACM Sigmetrics and Performance '89, Perf. Eval. Rev. 17 (1989) 200–208.
I. Mitrani and J.H. Hine, Complete parameterised families of job scheduling strategies, Acta Inf. 8 (1977) 61–73.
J.A. Morrison, Asymptotic analysis of a large closed queueing network with discriminatory processor sharing, Queueing Syst. 9 (1991) 191–213.
T.M. O'Donovan, Direct solutions ofM/G/1 processor-sharing models, Oper. Res. 22 (1974) 1232–1235.
T.J. Ott, The sojourn time distribution in theM/G/1 queue with processor sharing, J. Appl. Prob. 21 (1984) 360–378.
K.M. Rege and B. Sengupta, TheM/G/1 processor-sharing queue with bulk arrivals, in:Modelling and Performance Evaluation of ATM Technology (North-Holland, Amsterdam, 1993) pp. 417–432.
K.M. Rege and B. Sengupta, A decomposition theorem and related results for the discriminatory processor sharing queue, NEC USA Tech. Rep. No. 92-C018-4-5007-5, also AT&T Bell Laboratories Internal Publication (1992).
M. Sakata, S. Noguchi and J. Oizumi, Analysis of a processor shared queueing model for time sharing systems,Proc. 2nd Hawaii Int. Conf. on Systems Sciences (1969) pp. 625–627.
R. Schassberger, A new approach to theM/G/1 processor-sharing queue, Adv. Appl. Prob. 16 (1984) 202–213.
J.L. Van den Berg and O.J. Boxma, TheM/G/1 queue with processor sharing and its relation to a feedback queue, Queueing Syst. 9 (1991) 365–402.
S.F. Yashkov, A derivation of response time distribution for anM/G/1 processor-sharing queue, Probl. Cont. Inf. Theory 12 (1983) 133–148.
S.F. Yashkov, Processor sharing queues: Some progress in analysis, Queueing Syst. 2 (1987) 1–17.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rege, K.M., Sengupta, B. A decomposition theorem and related results for the discriminatory processor sharing queue. Queueing Syst 18, 333–351 (1994). https://doi.org/10.1007/BF01158767
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158767