Scalable load balancing in interference-prone queueing systems
From MaRDI portal
Cites work
- A comparative analysis of the successive lumping and the lattice path counting algorithms
- A general ``power-of-\(d\) dispatching framework for heterogeneous systems
- A simple dynamic routing problem
- A simple proof of the optimality of a threshold policy in a two-server queueing system
- A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
- Asymptotic independence of queues under randomized load balancing
- Asymptotic optimality of balanced routing
- Choosing among heterogeneous server clouds
- Computing in operations research using Julia
- DES and RES processes and their explicit solutions
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- JuMP: a modeling language for mathematical optimization
- Level product form QSF processes and an analysis of queues with Coxian interarrival distribution
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the optimal assignment of customers to parallel servers
- Optimal Routing of Fixed Size Jobs to Two Parallel Servers
- Pull-based load distribution in large-scale heterogeneous service systems
- Queue-length-aware dispatching in large-scale heterogeneous systems
- Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
- The mean-field computation in a supermarket model with server multiple vacations
- Threshold control policies for heterogeneous server systems
This page was built for publication: Scalable load balancing in interference-prone queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319240)
