A decomposition procedure for the analysis of a closed fork/join queueing system

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 res...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 1991-03, Vol.40 (3), p.365-370
Hauptverfasser: Liu, Y.C., Perros, H.G.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Approximation algorithms
Computer networks
Delay
Distributed computing
Exact sciences and technology
Iterative algorithms
Multiprocessor interconnection networks
Operational research and scientific management
Operational research. Management science
Queueing analysis
Queuing theory. Traffic theory
Routing
Testing
Winches
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.76416