Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times: Fluid Limit of the Maximum Queue Length with a Non-Zero Initial ConditionResearch Paper
A fork-join queue splits every incoming job into tasks, sends one task to each of parallel servers, and declares the job complete only when all tasks are done. The model describes assembly systems in which a manufacturer orders parts from suppliers and can only start production when every part has arrived, as well as parallel computing and storage…