Equivalence Relations in Queueing Models of Fork/Join Networks with Blocking

Abstract Fork/join (F/J) networks can be used to model parallel processing computer systems.and manufacturing systems. In this paper, we present some fundamental equivalence properties that hold for F/J networks with blocking. Two networks that are equivalent may appear different, but their behavior is closely related. Their throughputs are the same and there is a simple relationship between their average buffer levels. We study a model of F/J networks where processing times are exponentially distributed. We prove a theorem that provides a test for equivalence and illustrate it with several examples.

[1]  Kishor S. Trivedi,et al.  Analytic Queueing Models for Programs with Internal Concurrency , 1983, IEEE Transactions on Computers.

[2]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[3]  Tadeusz Czachórski,et al.  Performance evaluation of fork and join synchronization primitives , 1987, Acta Informatica.

[4]  Harry G. Perros,et al.  On equivalencies of blocking mechanisms in queueing networks with blocking , 1986 .

[5]  Asser N. Tantawi,et al.  Approximate Analysis of Fork/Join Synchronization in Parallel Queues , 1988, IEEE Trans. Computers.

[6]  Mostafa H. Ammar,et al.  Modelling and analysis of unreliable manufacturing assembly networks with finite storages , 1980 .

[7]  de Mbm René Koster,et al.  Capacity Oriented Analysis and Design of Production Systems , 1989 .

[8]  Kishor S. Trivedi,et al.  Queueing Network Models for Parallel Processing with Asynchronous Tasks , 1982, IEEE Transactions on Computers.

[9]  Asser N. Tantawi,et al.  Performance Analysis of Parallel Processing Systems , 1988, IEEE Trans. Software Eng..

[10]  Mostafa Ammar,et al.  Equivalence relations in queueing models of manufacturing networks , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[11]  G. Yamazaki,et al.  Properties of duality in tandem queueing systems , 1975 .

[12]  H. G. Perros,et al.  Approximate analysis of a closed fork/join model , 1991 .

[13]  Gordon F. Newell,et al.  Cyclic Queuing Systems with Restricted Length Queues , 1967, Oper. Res..

[14]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[15]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[16]  G. Pujolle,et al.  Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room , 1979, IEEE Transactions on Software Engineering.

[17]  E. Muth.  The Reversibility Property of Production Lines , 1979 .

[18]  B. Melamed.  Note-A Note on the Reversibility and Duality of Some Tandem Blocking Queueing Systems , 1986 .

[19]  Harry G. Perros,et al.  Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers , 1989, IEEE Trans. Software Eng..