Fork-join and redundancy systems with heavy-tailed job sizes
From MaRDI portal
Publication:6163557
DOI10.1007/S11134-022-09856-6zbMath1525.60108arXiv2105.13738OpenAlexW3164151830MaRDI QIDQ6163557
Sem C. Borst, Youri Raaijmakers, Onno J. Boxma
Publication date: 26 June 2023
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.13738
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Large deviations (60F10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Waiting time asymptotics in the single server queue with service in random order
- Tail asymptotics for delay in a half-loaded \(\mathrm{GI}/\mathrm{GI}/2\) queue with heavy-tailed job sizes
- Asymptotic behaviour of Wiener-Hopf factors of a random walk
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Subexponential asymptotics for stochastic processes: Extremal behavior, stationary distributions and first passage probabilities
- Patterns of buffer overflow in a class of queues with long memory in the input stream
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- Open problems in queueing theory inspired by datacenter computing
- Redundancy scheduling with scaled Bernoulli service requirements
- Heavy tails in multi-server queue
- Tail Asymptotics for the Busy Period in the GI/G/1 Queue
- On Large Delays in Multi-Server Queues with Heavy Tails
- On Sums of Conditionally Independent Subexponential Random Variables
- Two Parallel Queues Created by Arrivals with Two Demands I
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- An Introduction to Heavy-Tailed and Subexponential Distributions
- Regularly varying functions
This page was built for publication: Fork-join and redundancy systems with heavy-tailed job sizes
