Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Achievable Performance of Blind Policies in Heavy Traffic

14 references·1 citing·39 second hop

FromToDepth

this work references cited by second hop

References

2003Applied Probability and Queues1,453 cited
1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline562 cited
2001Largest Weighted Delay First Scheduling: Large Deviations and Optimality198 cited
2007The Foreground–Background queue: A survey87 cited
2007Tails in scheduling86 cited
2004Diffusion approximation for a processor sharing queue in heavy traffic83 cited
2012Is Tail-Optimal Scheduling Possible?83 cited
1990On extremal service disciplines in single-stage queueing systems66 cited
2008Preventing Large Sojourn Times Using SMART Scheduling49 cited
2010Tail-robust scheduling via limited processor sharing34 cited
2006Handling load with less stress30 cited
2011Heavy-traffic analysis of mean response time under Shortest Remaining Processing Time28 cited
2004On the average sojourn time under M/M/1/SRPT27 cited
2015Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling20 cited

Cited by

2020Simple Near-Optimal Scheduling for the M/G/113 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work