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

From MaRDI portal
Publication:5085144



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 Noinfty. 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.












This page was built for publication: Large fork-join queues with nearly deterministic arrival and service times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085144)