Summary
We consider a closed two-stage system of exponential processor sharing nodes and compute the distribution of a customer’s residence time at a node and his cycle time in the system.
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.
Similar content being viewed by others
References
Coffmann, E.G., Jr.; Fayolle, G.; Mitrani, I.:Sojourn Times in a Tandem Queue with Overtaking: Reduction to a Boundary Value Problem, Preprint, 1984.
Coffmann, E.G., Jr.; Muntr, R.R.; TROTTER, H.: Waiting Time DistriDistributions for Processor Sharing Systems, J. Assoc. Comp. Mach. 17, 123–130, 1970
Daduna, H.: Burke’s Theorem on Passage Times in GORDON-NEWELL Networks, Adv. Appl. Prob. 16, 867–886, 1984
Mitra, D.: Waiting Time Distributions from Closed Queueing Network Models of Shared-Processor Systems, in: KYLSTRA, F.J. (ed.): Proc. Performance 81, North-Holland, Amsterdam, 113–131, 1981
Mitra, D.; Morrison, J.A.: Asymptotic Expansions of Moments of the Waiting Time in Closed and Open Processor-sharing Systems with Multiple Job Classes, Adv. Appl. Prob. 15, 813–839, 1983
Schassberger, R.: A New Approach to the M/G/1 Processor-sharing Queue, Adv. Appl. Prob. 16, 202–213, 1984
Sevcik, K.C.; Mitrani, I.: The Distribution of Queueing Network States at Input and Output Instants, J. Assoc. Comp. Mach. 28, 358–371, 1981
Simon, B.; Foley, R.D.: Some Results on Sojourn Times in Acyclic Jackson Networks, Manag. Sci. 25, 1027–1034, 1979
Walrand, D.J.; Varaiya, P.: Sojourn Times and the Overtaking Condition in Jacksonian Networks, Adv. Appl. Prob. 12, 1000–1018, 1980
Yashkov, S.F.: A Derivation of Response Time Distribution for an M/G/1 Processor Sharing Queue, Problems of Control and Information Theory 12, 133–148, 1981
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daduna, H. (1985). The Distribution of Residence Times and Cycle Times in a Closed Tandem of Processor Sharing Queues. In: Beilner, H. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik—Fachberichte, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87472-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-87472-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15969-8
Online ISBN: 978-3-642-87472-7
eBook Packages: Springer Book Archive