Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic

Abstract

We study a fork-join network of stations with multiple servers and nonexchangeable synchronization in heavy traffic under the first-come-first- served (FCFS) discipline. Tasks are only synchronized if all the tasks associated with the same job are completed. Service times of parallel tasks of each job can be correlated. We jointly consider the number of tasks in each waiting buffer for synchronization with the number of tasks in each parallel service station and the number of synchronized jobs. We develop a new approach to show a functional central limit theorem for these processes in the quality-driven regime, under general assumptions on arrival and service processes. Specifically, we represent these processes as functionals of a sequential empirical process driven by the sequence of service vectors for each job’s parallel tasks. All of the limiting processes are functionals of two independent processes, i.e., the limiting arrival process and a generalized Kiefer process driven by the service vector of each job. We characterize the transient and stationary distributions of the limiting processes.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 18 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.