Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues

DOI10.1287/moor.2015.0768zbMath1342.60156OpenAlexW2336727371MaRDI QIDQ3186544

Łukasz Kruk, Ewa Sokołowska

Publication date: 10 August 2016

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2015.0768

zbMATH Keywords

queueingresponse timefluid modelfluid limitshortest remaining processing time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Random measures (60G57) Functional limit theorems; invariance principles (60F17)

Related Items (4)

Continuity and monotonicity of solutions to a greedy maximization problem ⋮ Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
• A large-deviations analysis of the GI/GI/1 SRPT queue
• Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
• Accuracy of state space collapse for earliest-deadline-first queues
• Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
• State space collapse with application to heavy traffic limits for multiclass queueing networks
• Queues with equally heavy sojourn time and service requirement distributions
• The fluid limit of a heavily loaded processor sharing queue
• Convergence to equilibria for fluid models of FIFO queueing networks
• Heavy traffic limit for a processor sharing queue with soft deadlines
• 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
• Diffusion limits for shortest remaining processing time queues
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Stability of earliest-due-date, first-served queueing networks

This page was built for publication: Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues