A Fast Simulation for Thousands of General Homogeneous Fork/Join Queues

Chen, Ray Jinzhu; Zhang, Haiying; Hu, Hailong

doi:10.1109/isms.2010.63

Cited by 4 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We refer to [14], [19] for notation. The simulation source codes are available on our website [7] which is an improvement from the codes in [5], [6].…”

Section: Uncorking the Bottleneckmentioning

confidence: 99%

“…The analysis of fork-join in parallel queues has been studied for at least 30 years [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26]. Exact analysis of this model for M/M/1 HFJ queues was achieved only for K ¼ 2 by Flatto and Hahn [8], [9] in 1984 and 1985.…”

Section: Introductionmentioning

confidence: 99%

“…However, most of them were not reusable. In 2009, we[5],[6] introduced a simple and reusable simulation evaluation methodology for general HFJ systems to calculate T K for thousands of…”

mentioning

confidence: 99%

See 2 more Smart Citations

An Upper Bound Solution for Homogeneous Fork/Join Queuing Systems

Chen

2011

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

In this paper, we use dynamic-bubblesort technology [4] to analyze general first-in-first-out K-queue homogenous fork/join queuing (HFJ) systems for any K ! 2. Jobs arrive with a mean rate and a general arrival distribution. Upon arrival, a job forks into K tasks. Task k; k ¼ 1; 2; . . . ; K, is assigned to the kth queuing system, which is a first-in-first-out server with a general service distribution and an infinite capacity queue. A job leaves the HFJ system as soon as all its tasks complete their service. We mathematically prove an upper bound solution for the mean response time that we denote by T K . The upper bound solution of general K-queue HFJ systems for any K ! 2 is very simple and practical-one only needs to simulate a small number of queues (e.g., 16 queues). The tightness is evaluated by comparing with the simulation of thousands of queues for three different HFJ cases. The maximum offset for our upper bounds over all the simulations is less than 5 percent. The corresponding source codes (reusable) are offered on our website for others to use.

show abstract

“…We refer to [14], [19] for notation. The simulation source codes are available on our website [7] which is an improvement from the codes in [5], [6].…”

Section: Uncorking the Bottleneckmentioning

confidence: 99%