Name
Abstract | ||
|---|---|---|
This paper presents an analysis of closed, balanced, fork-join queueing networks with exponential service time distributions. The fork-join queue is mapped onto two non-parallel networks, namely, a serial-join model and a state-dependent model. Using these models, it is proven that the proportion of the number of jobs in the different subsystems of the fork-join queueing network remains constant, irrespective of the multiprogramming level. This property of balanced fork-join networks is used to compute quick, inexpensive bounds for arbitrary fork-join networks. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1145/233013.233048 | SIGMETRICS |
Keywords | Field | DocType |
arbitrary fork-join network,serial-join model,fork-join queueing network,fork-join queue,exponential service time distribution,multiprogramming level,balanced fork-join network,inexpensive bound,state-dependent model,different subsystems,stochastic modeling,real time systems,communication networks,computer architecture | Mean value analysis,Bulk queue,Computer science,Queue,Real-time computing,Queueing theory,Layered queueing network,Gordon–Newell theorem,Fork–join queue,G-network,Distributed computing | Conference |
Volume | Issue | ISSN |
24 | 1 | 0163-5999 |
ISBN | Citations | PageRank |
0-89791-793-6 | 7 | 0.56 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elizabeth Varki | 1 | 114 | 9.71 |
| Lawrence W. Dowdy | 2 | 512 | 123.44 |