Large fork-join queues with nearly deterministic arrival and service times
Probability
2021-08-24 v3 Performance
Abstract
In this paper, we study an server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as . 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.
Keywords
Cite
@article{arxiv.1912.11661,
title = {Large fork-join queues with nearly deterministic arrival and service times},
author = {Dennis Schol and Maria Vlasiou and Bert Zwart},
journal= {arXiv preprint arXiv:1912.11661},
year = {2021}
}
Comments
36 pages, 15 figures