Queueing Systems

, Volume 14, Issue 3–4, pp 239–273 | Cite as

The M/G/1 processor-sharing model: transient behavior

  • M. Yu. Kitaev
Invited Paper


This paper deals with the M/G/1 model with processor-sharing service discipline. LetL*(t, x) denote the number of jobs present at timet whose attained service time is not greater thanx,x⩾0, andV0(t,z) the sojourn time of a tagged job placed in the system at timet and requiringz units of service. Explicit analytical expressions are obtained for the joint distribution ofL*(t, ·) andV0(t, ·) under various initial conditions in terms of the Laplace transform with respect tot. It is shown that for initial conditions of special kind (there is one job or none) the results can be expressed in a closed form.


Processor-sharing time-sharing transient behavior virtual sojourn time distribution branching process marked point process random measure predictable projection random time change 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Abate and W. Whitt, Transient behavior of the M/M/1 queue via Laplace transforms, Adv. Appl. Prob. 20 (1988) 145–178.Google Scholar
  2. [2]
    J. Abate and W. Whitt, The Fourier-series method for inverting transforms of probability distributions, Queueing Systems 10 (1992) 5–88.Google Scholar
  3. [3]
    J.L. van den Berg and O.J. Boxma, The M/G/1 queue with processor sharing and its relation to a feedback queue, Queueing Systems 9 (1991) 365–402.Google Scholar
  4. [4]
    R.M. Blumenthal and R.K. Getoor,Markov Processes and Potential Theory (Academic Press, New York, 1968).Google Scholar
  5. [5]
    P. Bremaud,Point Processes and Queues: Martingale Dynamics, Lecture Notes in Math. (Springer, 1981).Google Scholar
  6. [6]
    E.G. Coffman, R.R. Muntz and H. Trotter, Waiting time distributions for processor-sharing systems, J. Assoc. Comput. Mach. 17 (1970) 123–130.Google Scholar
  7. [7]
    K.S. Crump, Numerical inversion of Laplace transforms using a Fourier-series approximation, J. ACM 23 (1976) 89–96.Google Scholar
  8. [8]
    C. Dellacherie and P.-A. Meyer,Probabilities and Potential, North-Holland Math. Studies, Vol. 29 (1975).Google Scholar
  9. [9]
    W. Feller,An Introduction to Probability Theory and its Applications, Vol. II, 2nd ed. (Wiley, New York, 1971).Google Scholar
  10. [10]
    D.P. Gaver and P.A. Jacobs, Processor-shared time sharing models in heavy traffic, SIAM J. Comput. 15 (1986) 1085–1100.Google Scholar
  11. [11]
    S.A. Grishechkin, Crump-Mode-Jagers branching processes as applied to investigation of M/G/1 system with a processor partitioning, Theor. Prob. Appl. 36 (1991) No. 1.Google Scholar
  12. [12]
    S.A. Grishechkin, On an application of branching processes for obtaining stationary distributions in the queueing theory, Theor. Prob. Appl. 36 (1991) No. 3.Google Scholar
  13. [13]
    S.A. Grishechkin, On relationship between processor-sharing queues and Crump-Mode-Jagers branching processes, Adv. Appl. Prob. 24 (1992) 653–698.Google Scholar
  14. [14]
    J. Jacod, Multivariate point processes: predictable projection, Radon-Nikodym derivatives, representations of martingales, Z. Wahr. verv. Geb. 31 (1975) 235–253.Google Scholar
  15. [15]
    D.G. Kendall, Some problems in the theory of queues, J. Roy. Statist. Soc. B13 (1951) 151–171.Google Scholar
  16. [16]
    M.Yu. Kitaev and S.F. Yashkov, Distribution of the conditional sojourn time in a system with division of time servicing, Eng. Cybernetics 16 (4) (1978) 162–167.Google Scholar
  17. [17]
    M.Yu. Kitaev and S.F. Yashkov, Analysis of single-channel queueing system with the discipline of uniform sharing of device, Eng. Cybernetics 17 (6) (1979) 42–49.Google Scholar
  18. [18]
    L. Kleinrock,Queueing Systems, Vol.II: Computer Applications (Wiley, New York, 1976).Google Scholar
  19. [19]
    T.J. Ott, The sojourn time distribution in the M/G/1 queue with processor sharing, J. Appl. Prob. 21 (1984) 360–378.Google Scholar
  20. [20]
    A.V. Pechinkin, Stationary probabilities in a system with discipline of advantageous distribution of a processor, Eng. Cybernetics 18 (5) (1980) 73–77.Google Scholar
  21. [21]
    R. Pyke and R. Schaufele, Limit theorems for Markov renewal processes, Ann. Math. Statist. 35 (1964) 1746–1764.Google Scholar
  22. [22]
    J.A.C. Reising, G. Hooghiemstra and M.S. Keane, The M/G/1 processor sharing queue as the almost sure limit of feedback queues, J. Appl. Prob. 27 (1990) 913–918.Google Scholar
  23. [23]
    M. Sakata, S. Noguchi and J. Oizumi, Analysis of a processor-shared queueing model for timesharing systems, in:Proc. 2nd Hawaii Int. Conf. on System Sciences (Univ. of Hawaii, Honolulu, 1969).Google Scholar
  24. [24]
    R. Schassberger, A new approach to the M/G/1 processor-sharing queue, Adv. Appl. Prob. 16 (1984) 202–213.Google Scholar
  25. [25]
    R. Schassberger, The steady-state distribution of spent service times present in the M/G/1 foreground-background processor-sharing queue, Preprint No 148, Technical Univ. of Berlin (1986).Google Scholar
  26. [26]
    R. Schassberger, The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time, Adv. Appl. Prob. 22 (1990) 456–479.Google Scholar
  27. [27]
    S.F. Yashkov, Processor-sharing queues: some progress in analysis (a survey), Queueing Systems 2 (1987) 1–12.Google Scholar
  28. [28]
    S.F. Yashkov, Mathematical aspects of the theory of queueing systems with processor sharing disciplines (a survey), Itogi Nauki i Tech. 29 (1991) (Ser. Teoriya Veroyatn. Matem. Statist. Teoreticheskaya. Cybernetika) (in Russian).Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1993

Authors and Affiliations

  • M. Yu. Kitaev
    • 1
  1. 1.MoscowRussia

Personalised recommendations