Heavy traffic limit for a processor sharing queue with soft deadlines

DOI10.1214/105051607000000014zbMath1130.60087arXiv0707.4600OpenAlexW3103868968MaRDI QIDQ2456052

H. Christian Gromoll, Łukasz Kruk

Publication date: 17 October 2007

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

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

zbMATH Keywords

heavy trafficprocessor sharingmeasure valued processsoft deadlines

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) Functional limit theorems; invariance principles (60F17)

Related Items (7)

Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ The fluid limit of the multiclass processor sharing queue ⋮ Edge minimality of EDF resource sharing networks ⋮ Fluid models of many-server queues with abandonment ⋮ Heavy traffic analysis for EDF queues with reneging ⋮ Diffusion limits of limited processor sharing queues ⋮ Steady state approximations of limited processor sharing queues in heavy traffic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accuracy of state space collapse for earliest-deadline-first queues
• Processor-sharing queues: Some progress in analysis
• 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
• Multiple-input heavy-traffic real-time queues.
• The fluid limit of a heavily loaded processor sharing queue
• Heavy traffic limits for some queueing networks
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• Invariant states and rates of convergence for a critical fluid model of a processor sharing queue.
• Diffusion approximation for a processor sharing queue in heavy traffic.
• Earliest-deadline-first service in heavy-traffic acyclic networks.
• Weak convergence and empirical processes. With applications to statistics
• Open Queueing Networks in Heavy Traffic
• GI/G/1 processor sharing queue in heavy traffic
• The Fluid Limit of an Overloaded Processor Sharing Queue
• Multiple channel queues in heavy traffic. I
• Stability of earliest-due-date, first-served queueing networks

This page was built for publication: Heavy traffic limit for a processor sharing queue with soft deadlines