Fluid limits for multiple-input shortest remaining processing time queues
From MaRDI portal
Recommendations
- Fluid limits for 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
- A fluid limit for processor-sharing queues weighted by functions of remaining amounts of service
- Fluid approximations for a processor-sharing queue
Cites work
- A large-deviations analysis of the GI/GI/1 SRPT queue
- Accuracy of state space collapse for earliest-deadline-first queues
- Convergence to equilibria for fluid models of FIFO queueing networks
- Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
- Diffusion limits for shortest remaining processing time queues
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Fluid limits for shortest remaining processing time queues
- Heavy traffic limit for a processor sharing queue with soft deadlines
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 786511 (Why is no real title available?)
- scientific article; zbMATH DE number 3255438 (Why is no real title available?)
- Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Multi-layered round robin routing for parallel servers
- Queues with equally heavy sojourn time and service requirement distributions
- Stability of earliest-due-date, first-served queueing networks
- State space collapse with application to heavy traffic limits for multiclass queueing networks
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- The fluid limit of a heavily loaded processor sharing queue
- 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
(11)- 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
- Fluid limits for shortest job first with aging
- Diffusion limits for SRPT and LRPT queues via EDF approximations
- Continuity and monotonicity of solutions to a greedy maximization problem
- Fluid limits for shortest remaining processing time queues
- Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
- Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
- Minimal and locally edge minimal fluid models for resource-sharing networks
- FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE
- Heavy traffic scaling limits for shortest remaining processing time queues with light tailed processing time distributions
This page was built for publication: Fluid limits for multiple-input shortest remaining processing time queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186544)