SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The steady-state appearance of the M / G /1 queue under the discipline of shortest remaining processing time
6 references·4 citing·30 second hop
The steady-state appearance of the M / G /1 queue under the discipline of shortest remaining processing time (1990)The steady-state appearance of the M / G …Palm Probabilities and Stationary Queues (1987)Palm Probabilities and Statio…A new approach to the M / G /1 processor-sharing queue (1984)A new approach to the M / G /…The Single Server Queue (1983)The Single Server QueueWarteschlangen (1973)WarteschlangenLetter 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…Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling (2015)Diffusion limits for shortest…Revisiting unfairness in Web server scheduling (2005)Revisiting unfairness in Web …Quantifying the properties of SRPT scheduling (2004)Quantifying the properties of…The M/G/1 processor-sharing model: transient behavior (1993)The M/G/1 processor-sharing m…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)Introduction to the Theory of Queues. (1963)Waiting Time Distributions for Processor-Sharing Systems (1970)Mathematical problems in the theory of shared-processor systems (1992)Processor-sharing models for integrated-services networks (2000)The impact of the service discipline on delay asymptotics (2003)Some Problems in the Theory of Queues (1951)Queueing Systems, Vol. II: Computer Applications. (1977)Point Processes and Queues (1981)Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue (2006)The M/G/1 processor-sharing queue with disasters (2006)A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues (2010)A Practical Guide to Heavy Tails (2000)Analysis of SRPT scheduling (2001)Simulation evaluation of hybrid srpt scheduling policies (2004)Nearly insensitive bounds on SMART scheduling (2005)Multiple channel queues in heavy traffic. I (1970)SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers (2021)Acyclic fork-join queuing networks (1989)Queueing models for systems with synchronization constraints (1989)Effective bandwidths of departure processes from queues with time varying capacities (2002)Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)Manufacturing flow line systems: a review of models and analytical results (1992)The origin of bursts and heavy tails in human dynamics (2005)Modeling bursts and heavy tails in human dynamics (2006)A service model in which the server is required to search for customers (1984)On the Optimality of the Generalized Shortest Queue Policy (1990)
this work references cited by second hop

References

  • 1983The Single Server Queue844 cited
  • 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
  • 1987Palm Probabilities and Stationary Queues181 cited
  • 1973Warteschlangen94 cited
  • 1984A new approach to the M / G /1 processor-sharing queue86 cited

Cited by

  • 2004Quantifying the properties of SRPT scheduling25 cited
  • 1993The M/G/1 processor-sharing model: transient behavior22 cited
  • 2015Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling20 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