Real-time queues in heavy traffic with earliest-deadline-first queue discipline

By Bogdan Doytchinov, John P. Lehoczky, Steven E. Shreve. 2001

150 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Management Information Systems

View Paper: https://www.semanticscholar.org/paper/80565fc8a005aa154221b1a3467234d26ad41725

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. P. Arun Raj Kumar
2. Kyoung-Dae Kim
3. Alan Burns
4. H. Christian Gromoll
5. Lui Raymond Sha
6. Ruth J. Williams
7. Amber L. Puha
8. Aloysius Ka-Lau Mok

In Electrical and Electronic Engineering

1. H. Christian Gromoll
2. Ruth J. Williams
3. Amber L. Puha
4. Aloysius Ka-Lau Mok
5. Tarek F. Abdelzaher
6. Kyoung-Dae Kim
7. P. Arun Raj Kumar
8. Kavita Ramanan

In Management Information Systems

1. H. Christian Gromoll
2. Kavita Ramanan
3. Ruth J. Williams
4. Amber L. Puha
5. Kyoung-Dae Kim
6. P. Arun Raj Kumar
7. Haya Kaspi
8. Weining Kang

Citations in the corpus

• Heavy traffic analysis for EDF queues with reneging (2011, background): “The Annals of Applied Probability 2011, Vol. 21, No. 2, 484–545 DOI: 10.1214/10-AAP681 © Institute of Mathematical Statistics, 2011”
• Diffusion approximation for a processor sharing queue in heavy traffic (2004, unknown): “Doytchinov, Lehoczky and Shreve [ 3 ] and Kruk, Lehoczky, Shreve and Yeung [11] have used measure valued processes in the context of a queueing system with deadlines.”
• THE FLUID LIMIT OF A HEAVILY LOADED PROCESSOR SHARING QUEUE (2002, methodology): “More recently, Doytchinov, Lehoczky and Shreve [8] used a measure valued descriptor in the context of a queueing system with deadlines.”
• On the optimal allocation of service to impatient tasks (2004, background): “Lehoczky (1996), (1997a), (1997b) and Doytchinov et al. (2001) considered the scheduling of queued tasks with deadlines.”
• Real Time Scheduling Theory: A Historical Perspective (2004, methodology): “Recently, Lehoczky and coauthors [74, 113, 118, 120, 119, 121, 227] developed an approximation method to compute the fraction of late tasks for the heavy traffic case in which the system has high average-case utilization.”
• Cyber–Physical Systems: A Perspective at the Centennial (2012, background): “results can be found in [155], [156] on real-time queueing theory for stochastic analysis of soft real-time systems, in [157], [158] on real-time scheduling analysis in a resource partitioned computing environment, in [159] on resource kernels as an approach for operating system resource management ”