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
Published in:
Computers, IEEE Transactions on
(Volume:40
,
Issue:
3
)
Date of Publication:
Mar 1991
- Page(s):
-
365
-
370
- ISSN :
-
0018-9340
- INSPEC Accession Number:
-
3939499
- Digital Object Identifier :
-
10.1109/12.76416
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Mar 1991
- Sponsored by :
-
IEEE Computer Society