Abstract
Fork and join queueing network models can be used to represent and analyse the performance of distributed and parallel processing computer systems with concurrence and synchronisation constraints and shared resources. Concurrence and synchronisation make the solution of such performance models more complex than classical queueing network analysis. We consider parallel processing systems where a set of independent tasks are executed simultaneously and can be represented by fork and join queueing networks. We present an approximate method to analyse open fork and join queueing networks with general service time distribution represented by Coxian distribution. Specifically, we derive two approximations of the joint queue length distribution and closed form expressions for all the moments of this distribution. We prove that the method provides lower and upper bounds on the queue length moments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Baccelli and A.M. Makowski, “Queueing models for systems with synchronization constraints” Proceedings of the IEEE, Vol. 77,1989.
F. Baccelli, W.A. Massey and D. Towsley, “Acyclic fork-join queueing network” J. of ACM, Vol. 36, 1989.
S. Balsamo and L. Donatiello, “Approximate performance analysis of parallel processing systems” in “Decentralised Systems”, M. Cosnard and C. Girault Ed., Elsevier Science, 1990, pp. 325–336.
S. Balsamo and I. Mura, “Approximate response time distribution in fork and join systems” in Proc. ACM Sigmetrics/Performance'95 Joint Conference, Ottawa, Ontario Canada, 1995.
S. Balsamo and I. Mura, “Synchronisation delay in hardware fault-tolerance techniques” in Proc. IEEE IPDS '96 Conf., Urbana-Champaign, Illinois USA, 1996.
S. Balsamo and I. Mura, “Bounds on queue length moments in Parallel Processing Systems with Coxian Services” University of Udine, Dept. of Math. and Comp. Sci., UDMI/04/97/RR, 1997.
M.A. Brun and G. Fajolle, “A distribution of the transaction processes in a simple fork and join system” in “Computer Performance and Reliability”, P. J. Courtois, G. Iazeolla and O. J. Boxma Ed., Elsevier Science, North-Holland, 1988.
D.R. Cox, “A use of complex probabilities in the theory of stochastic process” Proc. Cambridge Philos. Soc, Vol. 51, pp. 313–319, 1955.
L. Flatto and S. Hahn, “Two parallel queues created by arrivals with two demands I” SIAM Journal of Applied Mathematics, Vol. 44, pp. 1041–1053, 1984.
C. Kim and A.K. Agrawala, “Analysis of the Fork-Join queue” IEEE Transactions on Computers, Vol. 38, pp. 250–255, 1989.
D.E. Knuth, “The art of computer programming” Addison-Wesley, 1973.
R. Nelson, A. Tantawi and D. Towsley, “Performance analysis of parallel processing systems” IEEE Transactions of Software Engineering, Vol. 14, 1988.
R. Nelson and A.N. Tantawi, “Approximate analysis of fork-join synchronisations in parallel queues” IEEE Transactions on Computers, Vol. 37, pp. 739–743, 1988.
M. F. Neuts, “Matrix-geometric solutions in stochastic models” Johns Hopkins University Press, 1981.
H.G. Perros, “On the M/Ck/l queue” Performance Evaluation, Vol. 3, pp. 83–93, 1983.
B.M. Rao and M.J.M. Posner, “Algorithmic approximation analysis of the split and match queue” Comm. Statis. Stochastic Models, Vol. 1, pp. 433–456, 1985.
N. Van Dijk, “Truncation of Markov Chains with Applications to Queueing” Oper. Res., Vol. 39, 1991.
N. Van Dijk, “Error Bound Analysis of Queueing Networks” in Tutorial of Performance'96, Lausanne, Switzerland, 1996.
S. Varma and A.M. Makowski, “Interpolation approximation for symmetric fork-join queues” in Proc. Performance '93, Rome, 1993, pp. 245–273.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balsamo, S., Mura, I. (1997). On queue length moments in fork and join queuing networks with general service times. In: Marie, R., Plateau, B., Calzarossa, M., Rubino, G. (eds) Computer Performance Evaluation Modelling Techniques and Tools. TOOLS 1997. Lecture Notes in Computer Science, vol 1245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022209
Download citation
DOI: https://doi.org/10.1007/BFb0022209
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63101-9
Online ISBN: 978-3-540-69131-0
eBook Packages: Springer Book Archive