Diffusion limits for shortest remaining processing time queues
From MaRDI portal
Publication:5168838
DOI10.1214/10-SSY016zbMath1291.60187arXiv1005.1035OpenAlexW2001111589MaRDI QIDQ5168838
H. Christian Gromoll, Amber L. Puha, Łukasz Kruk
Publication date: 21 July 2014
Full work available at URL: https://arxiv.org/abs/1005.1035
Queueing theory (aspects of probability theory) (60K25) Random measures (60G57) Functional limit theorems; invariance principles (60F17)
Related Items (9)
Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ Instability of SRPT, SERPT and SJF multiclass queueing networks ⋮ Fluid limits for shortest job first with aging ⋮ Invariance of fluid limits for the shortest remaining processing time and shortest job first policies ⋮ Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling ⋮ A Skorokhod map on measure-valued paths with applications to priority queues ⋮ Heavy traffic analysis for EDF queues with reneging ⋮ Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A large-deviations analysis of the GI/GI/1 SRPT queue
- Queues with equally heavy sojourn time and service requirement distributions
- Multi-layered round robin routing for parallel servers
- Fluid Limits for Shortest Remaining Processing Time Queues
- The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- Weak convergence theorems for priority queues: preemptive-resume discipline
- Multiple channel queues in heavy traffic. I
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: Diffusion limits for shortest remaining processing time queues