Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

The Queue M/G/1 with the Shortest Remaining Processing Time Discipline

2 references·16 citing·32 second hop

FromToDepth

this work references cited by second hop

References

1961A Proof for the Queuing Formula: L = λ W2,777 cited
1954Priority Assignment in Waiting Line Problems417 cited

Cited by

1980A simple dynamic routing problem315 cited
2001Analysis of SRPT scheduling312 cited
1977A Classified Bibliography of Research on Optimal Design and Control of Queues194 cited
2003Classifying scheduling policies with respect to unfairness in an M/GI/1170 cited
1967The Queue M/G/1 With Feedback to Lower Priority Queues108 cited
1969A Survey of Analytical Time-Sharing Models95 cited
1968Feedback Queueing Models for Time-Shared Systems92 cited
2002Asymptotic convergence of scheduling policies with respect to slowdown87 cited
2007The Foreground–Background queue: A survey87 cited
1992Mathematical problems in the theory of shared-processor systems77 cited
2005Priority Auctions and Queue Disciplines That Depend on Processing Time76 cited
2003The impact of the service discipline on delay asymptotics72 cited
2009Fluid Limits for Shortest Remaining Processing Time Queues71 cited
2021

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

Open problems in queueing theory inspired by datacenter computing

62 cited

2005Nearly insensitive bounds on SMART scheduling56 cited

2004Size-based scheduling policies with inaccurate scheduling information54 cited