Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
DOI10.1007/S10479-021-03929-0zbMATH Open1498.60365OpenAlexW3122178183MaRDI QIDQ2115771FDOQ2115771
Authors: Łukasz Kruk 
Publication date: 21 March 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-03929-0
Recommendations
- Diffusion limits for SRPT and LRPT queues via EDF approximations
- Diffusion limits for shortest remaining processing time queues
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions
- Heavy traffic analysis for EDF queues with reneging
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) Random measures (60G57) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A large-deviations analysis of the GI/GI/1 SRPT queue
- Diffusion approximation for a \(G/G/1\) EDF queue with unbounded lead times
- Diffusion limits for SRPT and LRPT queues via EDF approximations
- Diffusion limits for shortest remaining processing time queues
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Fluid limits for multiple-input shortest remaining processing time queues
- Fluid limits for shortest remaining processing time queues
- Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
- Largest weighted delay first scheduling: Large deviations and optimality
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Multi-layered round robin routing for parallel servers
- Priority auctions and queue disciplines that depend on processing time
- Queues with equally heavy sojourn time and service requirement distributions
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Stochastic-Process Limits
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
Cited In (5)
- Accuracy of state space collapse for earliest-deadline-first queues
- Diffusion approximation for a \(G/G/1\) EDF queue with unbounded lead times
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions
- Diffusion limits for SRPT and LRPT queues via EDF approximations
This page was built for publication: Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115771)
