A tandem queueing system with priorities | Computing Skip to main content
Springer Nature Link
Log in

A tandem queueing system with priorities

Ein serielles Wartesystem mit Prioritäten

  • Published:
Computing Aims and scope Submit manuscript

Abstract

A system ofN unlimited queues andN time-discrete servers in series, is investigated. The input consists ofN stochastic processes where requests which have been generated according to thei-th process leave the system after they have received serivice by servers 1, 2, ...,i. The holding-time distributions can be calculated by means of an equivalence theorem which holds under certain conditions for the service times.

Zusammenfassung

Es wird eine serielle Anordnung vonN unbeschränkten Warteschlangen undN zeitdiskreten Bedienungsstationen untersucht. Der Eingangsstrom besteht ausN stochastischen Prozessen, wobei die Anforderungen, die zumi-ten Prozess gehören, das System verlassen, nachdem sie von den ersteni Bedienungsstationen bedient worden sind. Die Verteilung der Verweilzeiten können mit Hilfe eines Äquivalenzsatzes berechnet werden, wenn die Bedienungszeiten gewisse Bedingungen erfüllen.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Konheim, A. G., Meister, B.: Service in a Loop System. J. Assoc. Comput. Mach.19, 92–108 (1972).

    Google Scholar 

  2. Konheim, A. G., Meister, B.: Waiting Lines and Times in a System with Polling. J. Assoc. Comput. Mach.21, 470–490 (1974).

    Google Scholar 

  3. Meister, B.: Queueing Analysis of General Loop Systems. Computing14, 349–365 (1975).

    Google Scholar 

  4. Meister, B.: Ein zeitdiskretes Wartesystem mit unterbrechenden Prioritäten, Proceedings der Jahrestagung der Gesellschaft für Informatik 1975. (Lecture Notes in Computer Science, Vol. 34, pp. 582–592.) Berlin-Heidelberg-New York: Springer 1975.

    Google Scholar 

  5. Meister, B.: Tanden Queues with Increasing Service Times. Proceedings of the International Symposium on Operations Research, Heidelberg, September 1–3 (1976).

  6. Meister, B.: Verweilzeiten für zeitdiskrete Wartesysteme. Proceedings of a Workshop on Modelling of Computer Systems, Bonn, March 31–April 1 (1977). (Informatik Fachberichte, Vol. 9, pp. 24–47.) Berlin-Heidelberg-New York: Springer 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Zürich Research Laboratory, Säumerstraße 4, CH-8803, Rüschlikon, Switzerland

    B. Meister

Authors
  1. B. Meister
    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

Meister, B. A tandem queueing system with priorities. Computing 19, 203–208 (1978). https://doi.org/10.1007/BF02252199

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation