Redundancy scheduling with scaled Bernoulli service requirements

DOI10.1007/s11134-019-09621-2zbMath1494.68032arXiv1811.06309OpenAlexW2963551975WikidataQ127635850 ScholiaQ127635850MaRDI QIDQ2294086

Youri Raaijmakers, Onno J. Boxma, Sem C. Borst

Publication date: 10 February 2020

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.06309

zbMATH Keywords

queueingredundancystability conditiondispatchingparallel-server systemsscaled Bernoulli service requirements

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

On the Stability of Redundancy Models ⋮ The cost of collaboration ⋮ A lower bound on the stability region of redundancy-\(d\) with FIFO service discipline ⋮ Fork-join and redundancy systems with heavy-tailed job sizes ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ A Survey of Stability Results for Redundancy Systems ⋮ Open problems in queueing theory inspired by datacenter computing

Cites Work

• Queueing with redundant requests: exact analysis
• Applied Probability and Queues
• A Token-Based Central Queue with Order-Independent Service Rates
• On the Stability of Redundancy Models
• Redundancy-d: The Power of d Choices for Redundancy
• Unnamed Item

This page was built for publication: Redundancy scheduling with scaled Bernoulli service requirements