On queue length moments in fork and join queuing networks with general service times

Fork and join queueing network models can be used to represent and analyse the performance of distributed and parallel processing computer systems with concurrence and synchronisation constraints and shared resources. Concurrence and synchronisation make the solution of such performance models more...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Balsamo, Simonetta, Mura, Ivan
Format: Buchkapitel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Fork and join queueing network models can be used to represent and analyse the performance of distributed and parallel processing computer systems with concurrence and synchronisation constraints and shared resources. Concurrence and synchronisation make the solution of such performance models more complex than classical queueing network analysis. We consider parallel processing systems where a set of independent tasks are executed simultaneously and can be represented by fork and join queueing networks. We present an approximate method to analyse open fork and join queueing networks with general service time distribution represented by Coxian distribution. Specifically, we derive two approximations of the joint queue length distribution and closed form expressions for all the moments of this distribution. We prove that the method provides lower and upper bounds on the queue length moments.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0022209