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

Dennis Schol; Maria Vlasiou; Bert Zwart

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

Dennis Schol, Maria Vlasiou, Bert Zwart

Research output: Working paper › Preprint › Academic

75 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 language	English
Publisher	ArXiv.org
Publication status	Published - 25 Dec 2019

Keywords

math.PR
cs.PF

Access to Document

1912.11661v2Submitted version, 1.12 MB
1912.11661v3Submitted version, 1.13 MB

1 Article

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times
Schol, D., Vlasiou, M. & Zwart, B., May 2022, In: Mathematics of operations research. 47, 2, p. 1335-1364 30 p.
Research output: Contribution to journal › Article › Academic › peer-review

Open Access
File
5 Citations (Scopus)

44 Downloads (Pure)

Cite this

@techreport{30724d81be6748cf914fd81379252c79,

title = "Large fork-join queues with nearly deterministic arrival and service times",

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. ",

keywords = "math.PR, cs.PF",

author = "Dennis Schol and Maria Vlasiou and Bert Zwart",

note = "36 pages, 15 figures",

year = "2019",

month = dec,

day = "25",

language = "English",

publisher = "ArXiv.org",

type = "WorkingPaper",

institution = "ArXiv.org",

}

TY - UNPB

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

AU - Schol, Dennis

AU - Vlasiou, Maria

AU - Zwart, Bert

N1 - 36 pages, 15 figures

PY - 2019/12/25

Y1 - 2019/12/25

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

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

KW - math.PR

KW - cs.PF

M3 - Preprint

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

PB - ArXiv.org

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Research output

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times

Cite this