Cycle times in a serial fork-join network

Authors:
Sung-Seok Ko
Affiliations:
Department of Industrial Engineering, Konkuk University 1, Seoul, Korea
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Year:
2007

Citing 5
Cited 0

Approximate Analysis of Fork/Join Synchronization in Parallel Queues

IEEE Transactions on Computers
On the diffusion approximation to a fork and join queueing model

SIAM Journal on Applied Mathematics
Bound Performance Models of Heterogeneous Parallel Processing Systems

IEEE Transactions on Parallel and Distributed Systems
Simulation Modeling and Analysis

Simulation Modeling and Analysis
Inter-Departure Times in Base-Stock Inventory-Queues

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents formulas for approximating the distribution of the cycle time of a job in a two-stage fork-join network in equilibrium. The key step is characterizing the departure process from the first node. Statistical tests justify that the approximate distribution is a good fit to the actual one. We discuss related approximations for m-stage networks, and present a formula for approximating the mean cycle time in a m-stage fork-join network.