A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System

An iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. The iterative procedure converges to the exact solution in the case of the closed 3-sibling fork/join queue. >

[1]  Asser N. Tantawi,et al.  Approximate Analysis of Fork/Join Synchronization in Parallel Queues , 1988, IEEE Trans. Computers.

[2]  Donald F. Towsley,et al.  Acyclic fork-join queuing networks , 1989, JACM.

[3]  Kishor S. Trivedi,et al.  Analytic Queueing Models for Programs with Internal Concurrency , 1983, IEEE Transactions on Computers.

[4]  William J. Stewart,et al.  Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains , 1985, JACM.

[5]  W. Stewart,et al.  ITERATIVE METHODS FOR COMPUTING STATIONARY DISTRIBUTIONS OF NEARLY COMPLETELY DECOMPOSABLE MARKOV CHAINS , 1984 .

[6]  F. Baccelli,et al.  The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds , 1989, Advances in Applied Probability.

[7]  Kishor S. Trivedi,et al.  Queueing Network Models for Parallel Processing with Asynchronous Tasks , 1982, IEEE Transactions on Computers.

[8]  Armand M. Makowski,et al.  Simple computable bounds for the fork-join queue , 1985 .

[9]  Asser N. Tantawi,et al.  Performance Analysis of Parallel Processing Systems , 1988, IEEE Trans. Software Eng..

[10]  David F. McAllister,et al.  An Iterative Method for the Exact Solution of Coxian Queueing Networks , 1981, SIGMETRICS.

[11]  Tadeusz Czachórski,et al.  Performance evaluation of fork and join synchronization primitives , 1987, Acta Informatica.

[12]  Armand M. Makowski,et al.  The fork-join queue and related systems with synchronization constraints: stochastic ordering,approximations and computable bounds , 1986 .

[13]  H. G. Perros,et al.  Approximate analysis of a closed fork/join model , 1991 .

[14]  L. Flatto,et al.  Two parallel queues created by arrivals with two demands. II , 1984 .

[15]  Andrzej Duda.  Approximate Performance Analysis of Parallel Systems , 1987, Computer Performance and Reliability.