The Community for Technology Leaders
Green Image
<p>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.</p>
sibling; closed fork/join queueing system; iterative approximation algorithm; decomposability; Gauss-Seidel method; mean response time; system throughput; approximation theory; iterative methods; queueing theory.

H. Perros and Y. Liu, "A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System," in IEEE Transactions on Computers, vol. 40, no. , pp. 365-370, 1991.
81 ms
(Ver 3.3 (11022016))