Abstract
Several variants of multiple server queues with Poisson input, exponentially distributed service demands and processor sharing discipline are considered. These queues are approximated by sequences of models featuring a new natural discipline called Random Quantum Allocation (RQA) operating in discrete time. This approach can be used for the numerical approximation of waiting and response time distributions for processor sharing queues. In the particular case of the M/M/1-RQA model we derive the generating function of the waiting time distribution of a tagged customer conditioned on service demand and number of customers in the system and the corresponding first two moments. The results are compared with the results for the M/M/1 processor sharing queue. Additionally we discuss the effect of the number of parallel processors on the response time distribution under the condition of fixed total service capacity.
Since 1st February 1993 the first author is with Siemens AG, Bereich Verkehrstechnik, Ackerstraße 22, D-38126 Braunschweig
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Braband. Wartezeitverteilungen für M/M/N-Processor-Sharing-Modelle. Dissertation, Technische Universität Braunschweig, Braunschweig, 1992.
E. G. Coffman, R. Müntz, and H. Trotter. Waiting time distributions for processor- sharing systems. J. Ass. Comp. Machn 17: 123–130, 1970.
A. Erdélyi, editor. Higher Transcendental Functions, volume 1of Bateman Manuscript Project. McGraw Hill, New York, 1953.
A. C. Hearn. REDUCE User’s Manual Version 3.2. Rand Publication CP 78, 1985.
F. P. Kelly. Reversibility and Stochastic Networks. Wiley, Chichester, 1979.
J. A. Morrisson. Response time distribution for a processor-sharing system. SIAM J. Appl. Math., 45: 152–167, 1985.
R. Schafiberger. A new approach to the M/G/l processor sharing queue. Adv. Appl. Prob., 16: 202–213, 1984.
S. F. Yashkov. Processor-sharing queues: Some progress in analysis. Queueing Systems, 2: 1–17, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braband, J., Schaßberger, R. (1993). Random Quantum Allocation: A new approach to waiting time distributions for M/M/N processor sharing queues. In: Walke, B., Spaniol, O. (eds) Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78495-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-78495-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57201-5
Online ISBN: 978-3-642-78495-8
eBook Packages: Springer Book Archive