Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
From MaRDI portal
Publication:5358490
Recommendations
- Processor-sharing queues: Some progress in analysis
- An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue
- Performance analysis of joining the shortest queue model among a large number of queues
- Large deviations and the generalized processor sharing scheduling for a multiple-queue system
- scientific article; zbMATH DE number 2081023
- On the transient behavior of the processor sharing queue
- Approximating the mean response time of parallel queues with JSQ policy
Cited in
(11)- A general ``power-of-\(d\) dispatching framework for heterogeneous systems
- Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing
- Queue-length-aware dispatching in large-scale heterogeneous systems
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
- Mean-field fluctuations at diffusion scale in threshold-based randomized routing for processor sharing systems and applications
- The hydrodynamic limit of a randomized load balancing network
- Choosing among heterogeneous server clouds
- Mean field approximations to a queueing system with threshold-based workload control scheme
- Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Near equilibrium fluctuations for supermarket models with growing choices
This page was built for publication: Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358490)