Queueing with redundant requests: exact analysis
DOI10.1007/S11134-016-9485-YzbMATH Open1351.60122OpenAlexW2462681966MaRDI QIDQ335898FDOQ335898
Authors: Kristen Gardner, Samuel Zbarsky, Sherwin Doroudi, Mor Harchol-Balter, Esa Hyytiä, Alan Scheller-Wolf 
Publication date: 10 November 2016
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-016-9485-y
Recommendations
- Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
- Redundancy scheduling with scaled Bernoulli service requirements
- Stationary characteristics of an unreliable multi-server queueing system with losses and time redundancy
- Analysis of a redundant queuing system
- scientific article; zbMATH DE number 2088575
Applications of continuous-time Markov processes on discrete state spaces (60J28) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on discrete state spaces (60J27)
Cites Work
- Title not available (Why is that?)
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Two Parallel Queues Created by Arrivals with Two Demands I
- Two Parallel Queues Created by Arrivals with Two Demands II
- Analysis of the fork-join queue
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- A distributional form of Little's law
- The asymptotic workload behavior of two coupled queues
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Power Series for Stationary Distributions of Coupled Processor Models
- A product form solution to a system with multi-type jobs and multi-type servers
- Processor-sharing of two parallel lines
- Characterizations of generalized hyperexponential distribution functions
- A little flexibility is all you need: on the asymptotic value of flexible capacity in parallel queuing systems
- On the power of (even a little) resource pooling
- Resource allocation in grid computing
- Control of systems with flexible multi-server pools: a shadow routing approach
Cited In (29)
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- Power-of-two sampling in redundancy systems: the impact of assignment constraints
- A survey on skill-based routing with applications to service operations management
- On the Stability of Redundancy Models
- Editorial introduction: Special issue on product forms, stochastic matching, and redundancy
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Efficient scheduling in redundancy systems with general service times
- A product form for the general stochastic matching model
- The cost of collaboration
- A Token-Based Central Queue with Order-Independent Service Rates
- Stability regions of systems with compatibilities and ubiquitous measures on graphs
- Open problems in queueing theory inspired by datacenter computing
- Parallel multi-type many server conjecture
- Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancy
- New directions in pass-and-swap queues
- Performance paradox of dynamic matching models under greedy policies
- FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE
- A lower bound on the stability region of redundancy-\(d\) with FIFO service discipline
- Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
- Redundancy techniques for straggler mitigation in distributed optimization and learning
- A Survey of Stability Results for Redundancy Systems
- Directed FCFS infinite bipartite matching
- Matching queues with reneging: a product form solution
- Pass-and-swap queues
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Load-balancing for multi-skilled servers with Bernoulli routing
- Redundancy scheduling with scaled Bernoulli service requirements
This page was built for publication: Queueing with redundant requests: exact analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335898)
