Achievable Performance of Blind Policies in Heavy Traffic
DOI10.1287/MOOR.2017.0890zbMath1433.60086arXiv1512.07771OpenAlexW2204802102WikidataQ130149976 ScholiaQ130149976MaRDI QIDQ5219677
Nikhil Bansal, Bart Kamphorst, Bert Zwart
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07771
response timeheavy trafficcompetitive ratioshortest remaining processing time\(GI/GI/1\) queueblind policiesrandomized multilevel feedback
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handling load with less stress
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Online algorithms. The state of the art
- Nonclairvoyant scheduling
- Largest weighted delay first scheduling: Large deviations and optimality
- Diffusion approximation for a processor sharing queue in heavy traffic.
- On the average sojourn time under \(M/M/1/\)SRPT
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
- Preventing Large Sojourn Times Using SMART Scheduling
- Minimizing flow time nonclairvoyantly
- On extremal service disciplines in single-stage queueing systems
- Applied Probability and Queues
- Is Tail-Optimal Scheduling Possible?
- Random Fluid Limit of an Overloaded Polling Model
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: Achievable Performance of Blind Policies in Heavy Traffic
