Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling

DOI10.1214/14-AAP1076zbMath1328.60205arXiv1407.3837MaRDI QIDQ894810

Amber L. Puha

Publication date: 24 November 2015

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3837

zbMATH Keywords

queueingheavy trafficdiffusion limitshortest remaining processing timenonstandard scaling

Mathematics Subject Classification ID

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

Related Items (10)

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 ⋮ Fluid limits for earliest-deadline-first networks ⋮ Heavy-Traffic Analysis of Sojourn Time Under the Foreground–Background Scheduling Policy ⋮ Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms ⋮ A Skorokhod map on measure-valued paths with applications to priority queues ⋮ Achievable Performance of Blind Policies in Heavy Traffic ⋮ 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

• A large-deviations analysis of the GI/GI/1 SRPT queue
• Queues with equally heavy sojourn time and service requirement distributions
• A LIFO queue in heavy traffic
• Diffusion approximation for a processor sharing queue in heavy traffic.
• A multiclass closed queueing network with unconventional heavy traffic behavior
• Slowly varying functions and asymptotic relations
• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling