SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Diffusion limits for shortest remaining processing time queues
15 references·1 citing·34 second hop
Diffusion limits for shortest remaining processing time queues (2011)Diffusion limits for shortest remaining p…Fluid Limits for Shortest Remaining Processing Time Queues (2009)Fluid Limits for Shortest Rem…Multi-layered round robin routing for parallel servers (2006)Multi-layered round robin rou…A large-deviations analysis of the GI/GI/1 SRPT queue (2006)A large-deviations analysis o…Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)Classifying scheduling polici…Queues with Equally Heavy Sojourn Time and Service Requirement Distributions (2002)Queues with Equally Heavy Soj…Analysis of SRPT Scheduling: Investigating Unfairness (2000)Analysis of SRPT Scheduling: …The variance of delay time in queueing system M/G/1 with optimal strategy SRPT (1993)The variance of delay time in…Properties and applications of the optimal queueing strategy SRPT - a survey (1993)Properties and applications o…The 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…Weak convergence theorems for priority queues: preemptive-resume discipline (1971)Weak convergence theorems for…Weak convergence theorems for priority queues: preemptive-resume discipline (1971)Weak convergence theorems for…Multiple channel queues in heavy traffic. I (1970)Multiple channel queues in he…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…Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions (2022)Heavy traffic scaling limits …The Single Server Queue (1983)Applied Probability and Queues (1987)Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue (2003)Preventing Large Sojourn Times Using SMART Scheduling (2008)Scheduling despite inexact job-size information (2008)Queueing systems, volume II: computer applications (1977)Stochastic Modeling and the Theory of Queues (1989)A resource-allocation queueing fairness measure (2004)The Foreground–Background queue: A survey (2007)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)Analysis of SRPT scheduling (2001)Multiple channel queues in heavy traffic. II: sequences, networks, and batches (1970)Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue (1989)Heavy Traffic Limits for Some Queueing Networks (2001)Service-Level Agreements in Call Centers: Perils and Prescriptions (2008)Elements of Queueing Theory (2003)Large deviations of sojourn times in processor sharing queues (2006)Tail-robust scheduling via limited processor sharing (2010)Q-Zilla: A Scheduling Framework and Core Microarchitecture for Tail-Tolerant Microservices (2020)The single server queue in heavy traffic (1961)Open Queueing Networks in Heavy Traffic (1984)Brownian Models of Queueing Networks with Heterogeneous Customer Populations (1988)Numerical Methods for Stochastic Control Problems in Continuous Time (1990)Heavy traffic analysis for EDF queues with reneging (2011)Size- and state-aware dispatching problem with queue-specific job sizes (2011)Heavy traffic analysis for EDF queues with reneging (2018)Analysis of SRPT scheduling (2001)SRPT Scheduling for Web Servers (2001)Nearly insensitive bounds on SMART scheduling (2005)The Distributional Little's Law and Its Applications (1995)Stein’s method for steady-state diffusion approximations of $M/\mathit{Ph}/n+M$ systems (2017)
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
  • 1970Multiple channel queues in heavy traffic. I438 cited
  • 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
  • 2003Classifying scheduling policies with respect to unfairness in an M/GI/1170 cited
  • 1971Weak convergence theorems for priority queues: preemptive-resume discipline91 cited
  • 1971Weak convergence theorems for priority queues: preemptive-resume discipline87 cited
  • 2009Fluid Limits for Shortest Remaining Processing Time Queues71 cited
  • 1978Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline69 cited
  • 2002Queues with Equally Heavy Sojourn Time and Service Requirement Distributions50 cited
  • 2006A large-deviations analysis of the GI/GI/1 SRPT queue44 cited
  • 2000Analysis of SRPT Scheduling: Investigating Unfairness36 cited
  • 2006Multi-layered round robin routing for parallel servers35 cited
  • 1990The steady-state appearance of the M / G /1 queue under the discipline of shortest remaining processing time27 cited
  • 1993The variance of delay time in queueing system M/G/1 with optimal strategy SRPT21 cited
  • 1993

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

Properties and applications of the optimal queueing strategy SRPT - a survey
19 cited

Cited by

  • 2022Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions14 cited