SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Simulation evaluation of hybrid srpt scheduling policies
7 references·1 citing·18 second hop
Simulation evaluation of hybrid srpt scheduling policies (2004)Simulation evaluation of hybrid srpt sche…Quantifying the properties of SRPT scheduling (2004)Quantifying the properties of…A resource-allocation queueing fairness measure (2004)A resource-allocation queuein…Fairness and efficiency in web server protocols (2003)Fairness and efficiency in we…Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)Classifying scheduling polici…Asymptotic convergence of scheduling policies with respect to slowdown (2002)Asymptotic convergence of sch…Analysis of SRPT scheduling (2001)Analysis of SRPT schedulingLetter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)Letter to the Editor—A Proof …Revisiting unfairness in Web server scheduling (2005)Revisiting unfairness in Web …Queueing systems, volume II: computer applications (1977)Stochastic Modeling and the Theory of Queues (1989)The Foreground–Background queue: A survey (2007)Fluid Limits for Shortest Remaining Processing Time Queues (2009)Axioms of Cooperative Decision Making (1988)Size-based scheduling policies with inaccurate scheduling information (2004)Scheduling despite inexact job-size information (2008)Fairness and scheduling in single server queues (2010)The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)A Practical Guide to Heavy Tails (2000)Time-shared Systems (1967)Waiting Time Distributions for Processor-Sharing Systems (1970)OR Forum—Perspectives on Queues: Social Justice and the Psychology of Queueing (1987)QUANTIFYING FAIRNESS IN QUEUING SYSTEMS (2008)A Classified Bibliography of Research on Optimal Design and Control of Queues (1977)Beyond processor sharing (2007)Optimal state-free, size-aware dispatching for heterogeneous -type systems (2005)Nearly insensitive bounds on SMART scheduling (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
  • 2001Analysis of SRPT scheduling312 cited
  • 2003Classifying scheduling policies with respect to unfairness in an M/GI/1170 cited
  • 2002Asymptotic convergence of scheduling policies with respect to slowdown87 cited
  • 2004A resource-allocation queueing fairness measure82 cited
  • 2003Fairness and efficiency in web server protocols72 cited
  • 2004Quantifying the properties of SRPT scheduling25 cited

Cited by

  • 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