Summary
We give a discrete-time model for a central server computer system, and show that the equilibrium distribution is of product-form Given the requests for workload at the different stations of a cycle, we compute the conditional cycle time distribution, which is linear in that requests.
Zusammenfassung
Wir stellen ein zeit-diskretes Modell für Rechensysteme vor. Es wird gezeigt, daß die Gleichgewichtsverteilung des Systems eine Produktform besitzt. Für gegebene Bedienungszeitforderungen an den einzelnen Stationen eines Zyklus wird die bedingte Zyklusverteilung berechnet; diese ist linear in den Anforderungen.
This is a preview of subscription content, log in via an institution to check access.
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
BARBOUR, A.D.; SCHASSBERGER, R.: Insensitive Average Residence Times in Generalized Semi-Markov-Processes, Adv.Appl.Prob. 13, 720–735, 1981
BUZEN, J.P.: Computational Algorithms for Closed Queueing Networks with Exponential Servers, Comm. ACM (16), 527–531, 1973
COHEN, J.W.: The Multiple Phase Service Network with Generalized Processor Sharing, Acta Informatica, 12,245–284, 1979
KELLY, F.P.: Reversibility and Stochastic Networks, Wiley, 1979
KLEINROCK, L.: Queueing Systems, Vol.11, Wiley, 1976
KLEINROCK, L.: Time-shared Systems:A Theoretical Treatment, J.A.C.M. 14,242–261, 1967
SAKATA, M.; NOGUCHI, S.; OIZUMI, J.: An Analysis of the M/G/1 Queue Under Round-Robin Scheduling, Oper.Res.19,371–385, 1971
SALZA, S.; LAVENBERG, S.S.: Approximating Response Time Distributions in Closed Queueing Network Models of Computer Performance, Proc.Performance 81, 133–145, 1981
SCHASSBERGER, R.: The Doubly Stochastic Server: A Time-sharing Model, ZOR 25, 179–189, 1981
SCHASSBERGER, R.: Residence Time in the M/G/1 Processor Sharing Queue, Preprint 1982
SCHASSBERGER, R.; DADUNA, H.: A Discrete Time Round-Robin Queue with Bernoulli Input and General Arithmetic Sercice Time Distribution, Acta Informatica, 15, 251–263, 1981
SCHASSBERGER, R.; DADUNA, H.: Networks of Queues in Discrete Time, Preprint 1982
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schassberger, R., Daduna, H. (1983). A discrete-time technique for solving closed queueing network models of computer systems. In: Kühn, P.J., Schulz, K.M. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik-Fachberichte, vol 61. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68830-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-68830-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11990-6
Online ISBN: 978-3-642-68830-0
eBook Packages: Springer Book Archive