An Approximate Analysis of the Fork-Join Queue

분기 및 접합형태를 갖는 대기행렬 모형의 근사적인 분석

We present an approximate algorithmic approach for the m-server fork-join queueing system with infinite queue capacity. We analyze the system size and queue waiting time. We assume Poisson arrival process and independent exponential service times.