Redundancy-d: The Power of d Choices for Redundancy
From MaRDI portal
Publication:5360845
DOI10.1287/opre.2016.1582zbMath1378.90040OpenAlexW2604490148MaRDI QIDQ5360845
Kristen Gardner, Alan Scheller-Wolf, Samuel Zbarsky, Mark Velednitsky, Mor Harchol-Balter
Publication date: 26 September 2017
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2016.1582
Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (17)
On the Stability of Redundancy Models ⋮ The cost of collaboration ⋮ MDS coding is better than replication for job completion times ⋮ A lower bound on the stability region of redundancy-\(d\) with FIFO service discipline ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Subdiffusive Load Balancing in Time-Varying Queueing Systems ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ Stationary Distribution Analysis of a Queueing Model with Local Choice ⋮ A Survey of Stability Results for Redundancy Systems ⋮ Redundancy scheduling with scaled Bernoulli service requirements ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Large-scale parallel server system with multi-component jobs ⋮ Power-of-d-Choices with Memory: Fluid Limit and Optimality ⋮ Delay asymptotics and bounds for multitask parallel jobs ⋮ Power-of-two sampling in redundancy systems: the impact of assignment constraints ⋮ Parallel Server Systems with Cancel-on-Completion Redundancy ⋮ A Token-Based Central Queue with Order-Independent Service Rates
This page was built for publication: Redundancy-d: The Power of d Choices for Redundancy