Redundancy-d: the power of d choices for redundancy
From MaRDI portal
Publication:5360845
Recommendations
- Queueing with redundant requests: exact analysis
- Redundancy scheduling with scaled Bernoulli service requirements
- Stationary characteristics of an unreliable multi-server queueing system with losses and time redundancy
- On the analysis of randomized load balancing schemes
- Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control
Cited in
(26)- Open problems in queueing theory inspired by datacenter computing
- Large-scale parallel server system with multi-component jobs
- Power-of-two sampling in redundancy systems: the impact of assignment constraints
- The cost of collaboration
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Redundancy scheduling with scaled Bernoulli service requirements
- Delay asymptotics and bounds for multitask parallel jobs
- MDS coding is better than replication for job completion times
- A lower bound on the stability region of redundancy-\(d\) with FIFO service discipline
- Queueing with redundant requests: exact analysis
- Power-of-d-Choices with Memory: Fluid Limit and Optimality
- Stationary distribution analysis of a queueing model with local choice
- A Token-Based Central Queue with Order-Independent Service Rates
- On the Stability of Redundancy Models
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Subdiffusive load balancing in time-varying queueing systems
- A Survey of Stability Results for Redundancy Systems
- Parallel Server Systems with Cancel-on-Completion Redundancy
- Editorial introduction: Special issue on product forms, stochastic matching, and redundancy
- Efficient scheduling in redundancy systems with general service times
- Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancy
- New directions in pass-and-swap queues
- A game-theoretic framework for distributed load balancing: static and dynamic game models
- Appointment scheduling for parallel queues
- Admission control of quasi-reversible queueing systems: optimization and reinforcement learning
- Scalable load balancing in interference-prone queueing systems
This page was built for publication: Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360845)
