Skip to main content
SpringerLink
Log in

Processor-sharing queues: Some progress in analysis

  • Invited Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper reviews some recent results based on new techniques used in the analysis of main processor-sharing queueing systems. These results include the solutions of the problems of determining the sojourn time distributions and the distributions of the number of jobs in the M/G/1/t8 queue under egalitarian and feedback (foreground-background) processor-sharing disciplines. A brief discussion of some related results is also given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B.K. Asare and F.G. Foster, Conditional response time in the M/G/l processor-sharing systems, J. Appl. Prob. 20, 4 (1983) 910–915.

    Google Scholar 

  2. G.P. Basharin and A.L. Tolmachev, Queueing networks theory and its applications to an analysis of computer systems (in Russian), In: Itogi Nauki i Tekhniki, Ser. Teoriya veroyatn, V. 21 (VINITI, Moscow, 1983) 3–119.

    Google Scholar 

  3. Yu.K. Belyayev, B.V. Gnedenko and I.A. Ushakov, Mathematical problems of queuing and reliability theory, Engrg. Cybernetics 21, 6 (1983) 62–69 (Engl. trans. of Russian journ. Izv. Akad. Nauk SSSR, Tekh. Kibernet. (1983) No. 6, 3–12).

    Google Scholar 

  4. A.A. Borovkov,Asymptotic Methods in Queueing Theory, (Wiley, New York, 1984).

    Google Scholar 

  5. O.J. Boxma, M/G/∞ tandem queues, Stoch. Processes and their Applications 18, 1 (1984) 153–164.

    Google Scholar 

  6. O.J. Boxma, J.W. Cohen and N. Huffels, Approximations of the mean waiting time in an M/G/s queueing system, Oper. Res. 27, 6 (1979) 1115–1127.

    Google Scholar 

  7. E.G. Coffman and P.J. Denning,Operating Systems Theory (Prentice-Hall, Englewood Cliffs, 1973).

    Google Scholar 

  8. E.G. Coffman, G. Fayolle and I. Mitrani, Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem (to appear).

  9. E.G. Coffman, R. Muntz and H. Trotter, Waiting time distributions for processor-sharing systems, J. of ACM 17, 1 (1970) 123–130.

    Google Scholar 

  10. J.W. Cohen, The multiple phase service network with generalized processor-sharing, Acta Informatica 12, 2 (1979) 245–284.

    Google Scholar 

  11. J.W. Cohen,The Single Server Queues, 2nd ed. (North-Holland, Amsterdam, 1982).

    Google Scholar 

  12. J.W. Cohen, On processor-sharing and random service, J. Appl. Prob. 21, 4 (1984) 937.

    Google Scholar 

  13. J.W. Cohen and O.J. Boxma,Boundary Value Problem in Queueing System Analysis (North-Holland, Amsterdam, 1983).

    Google Scholar 

  14. J.W. Cohen and G. Hooghiemstra, Brownian excursions, the M/M/1 queue and their occupation times, Math, of Oper. Res. 6, 4 (1981) 608–629.

    Google Scholar 

  15. R.B. Cooper,Introduction to Queueing Theory, 2nd ed. (Elsevier/North-Holland, Amsterdam, 1981).

    Google Scholar 

  16. R.B. Cooper and Shun-Chen Niu, Benes's formula for M/M/1-FIFO “explained” by preemptive-resume LIFO, J. Appl. Prob. 23, 2 (1986) (to appear).

    Google Scholar 

  17. R.L. Disney and D. König, Queueing networks: a survey of their random processes, SIAM Review 27, 3 (1985) 335–403.

    Google Scholar 

  18. G. Fayolle, I. Mitrani and R. Jasnogorodski, Sharing a processor among many job classes, J. of ACM 27, 3 (1980) 519–532.

    Google Scholar 

  19. P. Franken, D. König, U. Arndt and V. Schmidt,Queues and Point Processes (Akademie-Verlag, Berlin, 1981).

    Google Scholar 

  20. N.K. Jaiswal, Performance evaluation studies for timesharing computer systems, Perform. Evaluation 2, 4 (1982) 223–236.

    Google Scholar 

  21. U. Jansen, Conditional expected sojourn times in insensitive queueing systems and networks, Adv. Appl. Prob. 16, 4 (1984) 906–919.

    Google Scholar 

  22. F.P. Kelly,Reversibility and Stochastic Networks (Wiley, New York, 1979).

    Google Scholar 

  23. M.Yu. Kitayev and S.F. Yashkov, Distribution of the conditional sojourn time in a system with division of time of servicing, Engrg. Cybernetics 16, 4 (1978) 162–167 (Engl. trans. of Russian journ. Izv. Akad. Nauk SSR. Tekh. Kibern. (1978) No. 4, 211–215).

    Google Scholar 

  24. M.Yu. Kitayev and S.F. Yashkov, Analysis of a single-channel queueing system with the discipline of uniform sharing of a device, Engrg. Cybernetics 17, 6 (1979) 42–49 (Engl. trans. of Russian journ. Izv. Akad. Nauk SSSR. Tekh. Kibern. (1979) No. 6, 64–71).

    Google Scholar 

  25. L. Kleinrock,Queueing Systems, Vol. II: Computer Applications (Wiley, New York, 1976).

    Google Scholar 

  26. G.P. Klimov, Time-sharing service systems. I, II, Theor. Prob, and its Appl. 19, 3 (1974) 532–551; 23–2 (1978) (Engl. trans. of Russian journ. Theoriya Veroyatn. i yeye Primen. 19, 3 (1974) 558–576; 23, 2 (1978) 331–339).

    Google Scholar 

  27. G.P. Klimov, A.K. Lyakhy and V.F. Matveyev,Mathematical Models of Time-Sharing Systems (in Russian) (Stiintsa, Kishinyev, 1983).

    Google Scholar 

  28. H. Kobayashi and A. Konheim, Queueing models of computer communications system analysis, IEEE Trans, on Commun. 25, 1 (1977) 2–28.

    Google Scholar 

  29. D. König, V.V. Rykov and V. Schmidt, Stationary queueing systems with dependences (in Russian). In: Itogi Nauki i Tekhniki. Ser. Teoriya Veroyatn. V. 18 (VINITI, Moscow, 1981) 95–186.

    Google Scholar 

  30. V.V. Lipayev and S.F. Yashkov,Efficiency of Methods of Organizing a Computing Process in Automatic Control Systems (in Russian) (Statistika, Moscow, 1975).

    Google Scholar 

  31. J. McKinney, Survey of analytical time-sharing models, Computing Surveys 1, 2 (1969) 105–116.

    Google Scholar 

  32. D. Mitra, Waiting time distributions from closed queueing networks models of shared-processor systems. In: Performance 81, Ed. F.J. Kylstra, (North-Holland, Amsterdam, 1981) 113–131.

    Google Scholar 

  33. D. Mitra and J.A. Morrison, Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes, Adv. Appl. Prob. 15, 4 (1983) 813–839.

    Google Scholar 

  34. J.A. Morrison, Response-time distribution for a processor-sharing system, SIAM J. App. Math. 45, 1 (1985) 152–167.

    Google Scholar 

  35. J.A. Morrison and D. Mitra, Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes, Adv. Appl. Prob. 17, 1 (1985) 163–185.

    Google Scholar 

  36. R. Muntz, Waiting time distributions for round-robin queueing systems. In:Proc. 22nd Int. Symp. on Computer-Commun. Networks and Teletraffic (Brooklyn Inst, New York, 1972) 429–439.

    Google Scholar 

  37. T.M. O'Donovan, Direct solutions of M/G/l processor-sharing models, Oper. Res. 22, 6 (1974) 1232–1235.

    Google Scholar 

  38. T.J. Ott, The sojourn-time distributions in the M/G/l queue with processor-sharing, J. Appl. Prob. 21, 2 (1984) 360–378.

    Google Scholar 

  39. A.V. Pechinkin, Stationary probabilities in a system with discipline of advantageous distribution of a processor, Engrg. Cybernetics 18, 5 (1980) (Engl. trans. of Russian journ. Izv. Akad. Nauk SSSR. Tekh. Kibernet. (1980) No. 5, 73–77).

  40. N.U. Prabhu,Stochastic Storage Processes: Queues, Insurance, Risk and Dams (Springer-Verlag, New York, 1980).

    Google Scholar 

  41. V. Ramaswami, The sojourn time in the GI/M/1 queue with processor-sharing, J. Appl. Prob. 21, 2 (1984).

    Google Scholar 

  42. K.M. Rege and B. Sengupta, Sojourn time distribution in a multiprogrammed computer system, AT&T Techn. J. 64, 5 (1985) 1077–1090.

    Google Scholar 

  43. S.M. Ross, Multi-server queues. In:Deterministic and Stochastic Scheduling, Eds. M. Dempster et al. (D. Reidel Publ. Co., 1982) 197–209.

  44. M. Sakate, S. Noguchi and J. Oizumi, An analysis of the M/G/l queue under round-robin scheduling, Oper. Res. 19, 2 (1971) 371–385.

    Google Scholar 

  45. R. Schassberger,Warteschlangen (Springer-Verlag, Wien, 1973).

    Google Scholar 

  46. R. Schassberger, On the response time distribution in a discrete round-robin queue, Acta Informatica 16, 1 (1981) 57–62.

    Google Scholar 

  47. R. Schassberger, A new approach to the M/G/l processor-sharing queue, Adv. Appl. Prob. 16, 1 (1984) 202–213.

    Google Scholar 

  48. R. Schassberger, The steady-state distribution of spent service times present in the M/G/l foreground-background processor-sharing queue. Preprint No. 148, Dept. of Mathematics, Technical University of Berlin, 1986.

  49. L. Schrage, The queue M/G/l with feedback to lower priority queues, Management Sci. 13, 7 (1967) 466–474.

    Google Scholar 

  50. B. Sengupta and D. Jagerman, A conditional response time of the M/M/1 processor-sharing queue, AT&T Techn. J. 64, 2 (1985) 409–421.

    Google Scholar 

  51. A.D. Solov'yev, Analysis of an M/G/l queue under various queueing disciplines (in Russian). In:Queueing Theory, Eds. B.V. Gnedenko and V.v. Kalashnikov (VNIISI, Moscow, 1981) 172–178.

    Google Scholar 

  52. D. Stoyan,Comparison Methods for Queues and other Stochastic Models, Engl. trans., ed. D.J. Daley (Wiley, New York, 1983).

    Google Scholar 

  53. A.L. Tolmachev, Insensitivity in queueing network with generalized processor-sharing discipline. In:1st World Congress of Bernoulli Soc. ISI. V.II (Nauka, Moscow, 1986) 555–556.

    Google Scholar 

  54. S.F. Yashkov, Distribution of the conditional waiting time in a system with division of time, Engrg. Cybernetics 15, 5 (1977) 44–52 (Engl. trans. of Russian journ. Izv. Akad. Nauk SSSR, Tekh. Kibernet. (1977) No. 5, 88–94.

    Google Scholar 

  55. S.F. Yashkov, On feedback sharing a processor among jobs with minimal serviced length (in Russian), Tekhnika Sredstv Svyazi. Ser. ASU (1978) No. 2, 51–62.

    Google Scholar 

  56. S.F. Yashkov, Some results of analyzing a probabilistic model of remote processing systems, Automatic Contr. & Comp. Sci. 15, 4 (1981) 1–8 (Engl. trans. of Russian journ. Automatika i Vychisl. Tekhnika (1981) No. 4, 3–11).

    Google Scholar 

  57. S.f. Yashkov, Some results of analysis of systems with time slicing (in Russian). In:Queueing Theory, Eds. B.V. Gnedenko and V.V. Kalashnikov (VNIISI, Moscow, 1981) 149–153.

    Google Scholar 

  58. S.F. Yashkov, A derivation of response time distribution for an M/G/l processor-sharing queue, Problems Contr. & Info. Theory 12, 2 (1983) 133–148.

    Google Scholar 

  59. S.f. Yashkov, Analysis of a system with priority-based processor-sharing, Automatic Contr. & Comput. Sci. 18, 3 (1984) 27–36 (Engl. trans. of Russian journ. Automatika i Vychisl. Tekhnika (1984), No. 3, 29–38).

    Google Scholar 

  60. S.F. Yashkov, Some remarks on processor-sharing systems. In:Fundamentals of Teletraffic Theory, Proc. 3rd Int. Seminar on Teletraffic Theory (VINITI, Moscow, 1984) 467–474.

    Google Scholar 

  61. S.F. Yashkov, On new results in study of systems with variable rate of servicing. In:Proc. 6th Int. Symp. on Info. Theory. Pt. 1 (VINITI, Moscow-Tashkent, 1984) 297–299.

    Google Scholar 

  62. S.F. Yashkov, Distribution of number of jobs in a feedback processor-sharing queue. In: Systems Analysis and Simulation 1985. 1: Theory and Foundations, Eds. A. Sydow et al. (AkademieVerlag, Berlin, 1985) 464–468.

    Google Scholar 

  63. S.F. Yashkov, A note on asymptotic estimates of the sojourn time variance in the M/G/l queue with processor-sharing, Syst. Anal. Model. Simul. 3, 3 (1986) 267–269.

    Google Scholar 

  64. S.F. Yashkov and M.Yu. Kitayev, One analytical model of shared-use systems, Automatic Contr. & Comput. Sci. 14, 1 (1980) 20–23 (Engl. trans. of Russian journ. Automatika i Vychisl. Tekhnika (1980) No. 1, 22–25).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Center, USSR Academy of Sciences, 40 Vavilov Street, 117333 GSP-1, Moscow, USSR

    S. F. Yashkov

Authors
  1. S. F. Yashkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yashkov, S.F. Processor-sharing queues: Some progress in analysis. Queueing Syst 2, 1–17 (1987). https://doi.org/10.1007/BF01182931

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01182931

Keywords

Search

Navigation