This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System
March 1991 (vol. 40 no. 3)
pp. 365-370

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] V. A. F. Almeida and L. W. Dowdy, "Performance analysis of a scheme for concurrency/synchronization using queueing network models," Tech. Rep. Comput. Sci. Dep., Vanderbilt Univ., 1987.
[2] F. Baccelli, A. M. Makowski, and A. Shwartz, "The fork-join queue and related systems with synchronization constraints: Stochastic ordering, and computable bounds,"Advances Appl. Probability, vol. 21, Sept. 1989.
[3] F. Baccelli, W. A. Massey, and D. Towsley, "Acyclic fork/join queueing networks,"J. ACM, vol. 36, pp. 615-642, 1989.
[4] W. L. Cao and W. J. Stewart, "Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains,"J. ACM, vol. 32, no. 3, pp. 702-719, July 1985.
[5] P. J. Courtois,Decomposability: Queueing and Computer System Applications. New York: Academic, 1977.
[6] S. L. Dodd, D. F. McAllister, and W. J. Stewart, "An iterative method for the exact solution of coxian queueing networks," inProc. ACM/SIGMETRICS Conf. Measurement Modeling Comput. Syst., Sept. 1981, pp. 97-104.
[7] A. Duda and T. Czachorski, "Performance evaluation of fork and join synchronization primitives,"Acta Informatica, vol. 24, pp. 525-553, 1987.
[8] A. Duda, "Approximate performance analysis of parallel systems," inProc. 2nd Int. Workshop Appl. Math. and Performance/Reliability Models of Comput./Commun. Syst., Rome, Italy, May 25-27, 1987.
[9] R. Koury, D. F. McAllister, and W. J. Stewart, "Methods for computing stationary distributions of nearly completely decomposable Markov chains,"SIAM J. Disc. Math., vol. 5, pp. 164-186, 1984.
[10] Y. C. Liu and H. G. Perros, "Approximate analysis of a closed fork/join model,"Euro. J. Oper. Res., to be published.
[11] Y. C. Liu and H. G. Perros, "A decomposition procedure for the analysis of a closed fork/join queueing system," Tech. Rep., Comput. Sci. Dep., North Carolina State Univ., 1988.
[12] R. Nelson, D. Towsley, and A. N. Tantawi, "Performance analysis of parallel processing systems," IBM Res. Rep., RC 12474, 1986.

Index Terms:
sibling; closed fork/join queueing system; iterative approximation algorithm; decomposability; Gauss-Seidel method; mean response time; system throughput; approximation theory; iterative methods; queueing theory.
Citation:
Y.C. Liu, H.G. Perros, "A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System," IEEE Transactions on Computers, vol. 40, no. 3, pp. 365-370, March 1991, doi:10.1109/12.76416
Usage of this product signifies your acceptance of the Terms of Use.