SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Quantifying the properties of SRPT scheduling
6 references·3 citing·18 second hop
Quantifying the properties of SRPT scheduling (2004)Quantifying the properties of SRPT schedu…Asymptotic convergence of scheduling policies with respect to slowdown (2002)Asymptotic convergence of sch…Analysis of SRPT scheduling (2001)Analysis of SRPT schedulingThe steady-state appearance of the M / G /1 queue under the discipline of shortest remaining processing time (1990)The steady-state appearance o…Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1978)Technical Note—A New Proof of…Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)Letter to the Editor—A Proof …The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)The Queue M/G/1 with the Shor…Revisiting unfairness in Web server scheduling (2005)Revisiting unfairness in Web …Nearly insensitive bounds on SMART scheduling (2005)Nearly insensitive bounds on …Simulation evaluation of hybrid srpt scheduling policies (2004)Simulation evaluation of hybr…Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)Priority Assignment in Waiting Line Problems (1954)A Proof for the Queuing Formula: L = λ W (1961)A Classified Bibliography of Research on Optimal Design and Control of Queues (1977)A simple dynamic routing problem (1980)The Single Server Queue (1983)The M/G/1 processor-sharing model: transient behavior (1993)Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling (2015)Queueing systems, volume II: computer applications (1977)Stochastic Modeling and the Theory of Queues (1989)Beyond processor sharing (2007)The Foreground–Background queue: A survey (2007)Fairness and scheduling in single server queues (2010)A Practical Guide to Heavy Tails (2000)Analysis of SRPT scheduling (2001)SRPT Scheduling for Web Servers (2001)Nearly insensitive bounds on SMART scheduling (2005)Optimal state-free, size-aware dispatching for heterogeneous -type systems (2005)
this work references cited by second hop

References

  • 1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline562 cited
  • 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
  • 2001Analysis of SRPT scheduling312 cited
  • 2002Asymptotic convergence of scheduling policies with respect to slowdown87 cited
  • 1978Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline69 cited
  • 1990The steady-state appearance of the M / G /1 queue under the discipline of shortest remaining processing time27 cited

Cited by

  • 2004Simulation evaluation of hybrid srpt scheduling policies22 cited
  • 2005Nearly insensitive bounds on SMART scheduling19 cited
  • 2005Revisiting unfairness in Web server scheduling18 cited

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