Large fork-join queues with nearly deterministic arrival and service times

Dennis Schol, Maria Vlasiou, Bert Zwart

Research output: Working paper

9 Downloads (Pure)

Abstract

In this paper, we study an $N$ server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as $N\to\infty$. This fluid limit depends on the initial number of tasks. In order to prove these results, we develop extreme value theory and diffusion approximations for the queue lengths.
Original languageEnglish
PublisherArXiv
Publication statusPublished - 25 Dec 2019

Keywords

  • math.PR
  • cs.PF

Fingerprint

Dive into the research topics of 'Large fork-join queues with nearly deterministic arrival and service times'. Together they form a unique fingerprint.

Cite this