Earliest-deadline-first service in heavy-traffic acyclic networks.

DOI10.1214/105051604000000314zbMath1084.60056arXivmath/0407136OpenAlexW3100439012MaRDI QIDQ1879911

Steven E. Shreve, Shu-Ngai Yeung, Łukasz Kruk, John P. Lehoczky

Publication date: 15 September 2004

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

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

zbMATH Keywords

workload processheavy traffic analysismulti-class acyclic queueing networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Brownian motion (60J65) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Random measures (60G57)

Related Items

Minimality of EDF networks with resource sharing ⋮ Fluid limits for earliest-deadline-first networks ⋮ Stability of linear EDF networks with resource sharing ⋮ Heavy traffic limit for a processor sharing queue with soft deadlines ⋮ An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems ⋮ Tardiness bounds under global EDF scheduling on a multiprocessor ⋮ Heavy traffic analysis for EDF queues with reneging ⋮ Accuracy of state space collapse for earliest-deadline-first queues ⋮ Stability of preemptive EDF queueing networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
• Multiple-input heavy-traffic real-time queues.
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
• Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem
• Stability of earliest-due-date, first-served queueing networks