Skip to main content
SpringerLink
Log in

A foreground-background time sharing queue with general service times

  • Conference paper
  • First Online:
Book cover Operating Systems (OS 1974)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 16))

Included in the following conference series:

  • 2310 Accesses

Abstract

A foreground-background queue with Poisson arrivals and independent and identically distributed service times with a general distribution H(x) is analysed using the method of the imbedded Markov chain. The generating function of the stationary distribution of queue sizes and the Laplace transform of the stationary distribution of waiting times is obtained for two priority disciplines: preemptive resume and non-preemptive or head-of-the-line. Numerical examples indicate that when the coefficient of variation of service times is high considerable reduction of total expected queue size can be obtained over the first-come-first served discipline. The results found for two queues and preemptive resume discipline can be extended to a system with an arbitrary number of queues.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coffman, E.G., “Markov Chain Analysis of Multiprogramming Computer Systems”, Naval Res. Log Quart., 16, 2, June 1969, pp. 175–197.

    Google Scholar 

  2. Cohen,J.W., The Single Server Queue, North Holland Publishing Co., 1969, pp. 625–629.

    Google Scholar 

  3. Fife,D.W., “An Optimization Model for Time Sharing”, Proc. AFIPS 66, SJCC, Vol. 28, pp. 97–104.

    Google Scholar 

  4. Gaver,D.P., “A Waiting Line with Interrupted Service Including Priorities”, Journal Royal St. Soc. (lB), June 1962.

    Google Scholar 

  5. Adiri,I. and Avi-Itzhak, “A Time-Sharing Queue”, Man.Sci., 15,11, 1969, pp. 639–657.

    Google Scholar 

  6. Kleinrock, “Analysis of a Time-Shared Processor”, Nav.Res.Log.Quart., 2,1 (1964), pp.59–73.

    Google Scholar 

  7. Kleinrock and Muntz, “Processor Sharing Queuing Models of Mixed Scheduling Disciplines”, JACM July 1972, Vol. 19, pp. 453–481.

    Article  Google Scholar 

  8. Schrage, “The Queue M¦G¦1 with Feedback Priority Queues”, Man.Sci., 13 (1967), pp. 466–474.

    Google Scholar 

  9. Takacs, Introduction to the Theory of Queues, Oxford U. Press, 1962, pp. 46–80.

    Google Scholar 

  10. Takacs, “Priority Queues”, Op. Res., Vol.12, 1(1964), pp.63–74.

    Google Scholar 

  11. Guimarāes,CĒlio, “Queuing Models with Applications to Scheduling in Operating Systems”, Ph.D. Thesis, Technical Report 1127, Computing and Information Sciences Department, Case Western Reserve University, Cleveland, Ohio, May 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal do Rio de Janeiro, Brasile

    C. Guimaraes

Authors
  1. C. Guimaraes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Gelenbe C. Kaiser

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guimaraes, C. (1974). A foreground-background time sharing queue with general service times. In: Gelenbe, E., Kaiser, C. (eds) Operating Systems. OS 1974. Lecture Notes in Computer Science, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029356

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06849-5

  • Online ISBN: 978-3-540-37805-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation