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

Dennis Schol; Maria Vlasiou; Bert Zwart

doi:10.1287/moor.2021.1171

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

Dennis Schol, Maria Vlasiou, Bert Zwart

Research output: Contribution to journal › Article › Academic › peer-review

6 Citations (Scopus)

73 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→∞. 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
Pages (from-to)	1335-1364
Number of pages	30
Journal	Mathematics of Operations Research
Volume	47
Issue number	2
Early online date	14 Dec 2021
DOIs	https://doi.org/10.1287/moor.2021.1171
Publication status	Published - 1 May 2022

Keywords

math.PR
cs.PF
queueing network
heavy traffic
nearly deterministic
fork-join queue
extreme value theory
fluid limit

Access to Document

10.1287/moor.2021.1171

arXiv 1912.11661v2Final author version , 1.12 MB

Cite this

@article{4ea5c801d9e0450986ae29aefc48bb3a,

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→∞. 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, queueing network, heavy traffic, nearly deterministic, fork-join queue, extreme value theory, fluid limit",

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

year = "2022",

month = may,

day = "1",

doi = "10.1287/moor.2021.1171",

language = "English",

volume = "47",

pages = "1335--1364",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "2",

}

TY - JOUR

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

AU - Schol, Dennis

AU - Vlasiou, Maria

AU - Zwart, Bert

PY - 2022/5/1

Y1 - 2022/5/1

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→∞. 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→∞. 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

KW - queueing network

KW - heavy traffic

KW - nearly deterministic

KW - fork-join queue

KW - extreme value theory

KW - fluid limit

UR - http://www.scopus.com/inward/record.url?scp=85134210982&partnerID=8YFLogxK

U2 - 10.1287/moor.2021.1171

DO - 10.1287/moor.2021.1171

M3 - Article

SN - 0364-765X

VL - 47

SP - 1335

EP - 1364

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Maximum waiting time in heavy-tailed fork-join queues

Cite this