Fluid limits for shortest remaining processing time queues
DOI10.1287/MOOR.1090.0409zbMATH Open1213.60145OpenAlexW2008297046MaRDI QIDQ3169072FDOQ3169072
Authors: Douglas G. Down, H. Christian Gromoll, Amber L. Puha 
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/48eec973ef124478ded623a865fe7fa157160778
Recommendations
- Fluid limits for multiple-input shortest remaining processing time queues
- Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
- Diffusion limits for shortest remaining processing time queues
- Fluid limits for shortest job first with aging
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
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) Functional limit theorems; invariance principles (60F17)
Cited In (18)
- Local edge minimality of SRPT networks with shared resources
- Continuity and monotonicity of solutions to a greedy maximization problem
- Instability of SRPT, SERPT and SJF multiclass queueing networks
- Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues
- Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
- A fluid approximation for a matching model with general reneging distributions
- Size- and state-aware dispatching problem with queue-specific job sizes
- A Skorokhod map on measure-valued paths with applications to priority queues
- Distribution-valued heavy-traffic limits for the \(\mathrm{G}/\mathrm{GI}/\infty\) queue
- Fluid limits for shortest job first with aging
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
- Heavy traffic analysis for EDF queues with reneging
- Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
- Stability of linear EDF networks with resource sharing
- Diffusion limits for shortest remaining processing time queues
- Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions
- Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
This page was built for publication: Fluid limits for shortest remaining processing time queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169072)
