SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
When Random-Order-of-Service outperforms First-Come-First-Served
8 references·0 citing·30 second hop
When Random-Order-of-Service outperforms First-Come-First-Served (2015)When Random-Order-of-Service outperforms …The Foreground–Background queue: A survey (2007)The Foreground–Background que…Beyond processor sharing (2007)Beyond processor sharingThe equivalence between processor sharing and service in random order (2003)The equivalence between proce…The waiting time distribution for the random order service $M/M/1$ queue (1997)The waiting time distribution…Queueing Systems. Vol. II -- Computer Applications (1977)Queueing Systems. Vol. II -- …Queueing Systems, Vol. II: Computer Applications. (1977)Queueing Systems, Vol. II: Co…The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)The Queue M/G/1 with the Shor…Machine Repair as a Priority Waiting-Line Problem (1956)Machine Repair as a Priority …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)Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain (1953)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)The Single Server Queue (1983)Sojourn time asymptotics in processor-sharing queues (2006)Queueing systems, volume II: computer applications (1977)Multi-Armed Bandit Allocation Indices. (1990)Preventing Large Sojourn Times Using SMART Scheduling (2008)Fairness and scheduling in single server queues (2010)Is Tail-Optimal Scheduling Possible? (2012)Time-shared Systems (1967)Boundary Value Problems in Queueing System Analysis (1983)PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING (2011)Minimizing slowdown in heterogeneous size-aware dispatching systems (2012)SOAP (2018)Large deviations of sojourn times in processor sharing queues (2006)Modeling human activity in the spirit of Barabasi’s queueing systems (2007)Scheduling for today's computer systems: bridging theory and practice (2007)Priority Queues (1964)Priority Auctions and Queue Disciplines That Depend on Processing Time (2005)Size- and state-aware dispatching problem with queue-specific job sizes (2011)Processor-sharing queues: Some progress in analysis (1987)Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network (1990)On Pooling in Queueing Networks (1998)Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage (1982)Waiting time distributions in the accumulating priority queue (2013)
this work references cited by second hop

References

  • 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
  • 1977Queueing Systems, Vol. II: Computer Applications.308 cited
  • 1977Queueing Systems. Vol. II -- Computer Applications158 cited
  • 2007The Foreground–Background queue: A survey87 cited
  • 1956Machine Repair as a Priority Waiting-Line Problem86 cited
  • 2007Beyond processor sharing62 cited
  • 2003The equivalence between processor sharing and service in random order54 cited
  • 1997The waiting time distribution for the random order service $M/M/1$ queue48 cited

Cited by

No citing works inside the corpus for this window.

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