An Upper Bound Solution for Homogeneous Fork/Join Queuing Systems

Abstract

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.

Low-Latency Heterogeneous Networks with Millimeter-Wave Communications

“…For Scenarios 4 to Scenario 6, we notice that there exists the process data splitting and merging. These processes correspond to the fork-join system [15] in practice, where the data can be correctly recovered at the UE with synchronization constrains for file transfer.…”