SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Simple Near-Optimal Scheduling for the M/G/1
16 references·0 citing·39 second hop
Simple Near-Optimal Scheduling for the M/G/1 (2020)Simple Near-Optimal Scheduling for the M/…Multi‐Armed Bandits, Gittins Index, and its Calculation (2014)Multi‐Armed Bandits, Gittins …Performance Modeling and Design of Computer Systems: Queueing Theory in Action (2013)Performance Modeling and Desi…Multi‐Armed Bandit Allocation Indices (2011)Multi‐Armed Bandit Allocation…On the Gittins index in the M/G/1 queue (2009)On the Gittins index in the M…Beyond processor sharing (2007)Beyond processor sharingNearly insensitive bounds on SMART scheduling (2005)Nearly insensitive bounds on …A resource-allocation queueing fairness measure (2004)A resource-allocation queuein…Mixed scheduling disciplines for network flows (2003)Mixed scheduling disciplines …Insensitivity in processor-sharing networks (2002)Insensitivity in processor-sh…On extremal service disciplines in single-stage queueing systems (1990)On extremal service disciplin…Multi-Armed Bandit Allocation Indices. (1990)Multi-Armed Bandit Allocation…Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures (1989)Scheduling Multiclass Single …Queueing Systems, Volume 2: Computer Applications. (1978)Queueing Systems, Volume 2: C…Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System (1972)Processor Sharing Queueing Mo…Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)Letter to the Editor—A Proof …Time-shared Systems (1967)Time-shared SystemsSome aspects of the sequential design of experiments (1952)Bandit Processes and Dynamic Allocation Indices (1979)The New Palgrave dictionary of economics (2008)Multi-Armed Bandits: Theory and Applications to Online Learning in Networks (2019)The Assistive Multi-Armed Bandit (2019)A Proof for the Queuing Formula: L = λ W (1961)Sharing a Processor Among Many Job Classes (1980)Introduction to Queueing Theory and Stochastic Teletraffic Models (2013)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Loss Networks (1991)Introduction to Stochastic Networks (1999)Insensitive load balancing (2004)Sojourn time asymptotics in processor-sharing queues (2006)Randomized load balancing with general service time distributions (2010)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)Scheduling despite inexact job-size information (2008)Fairness and scheduling in single server queues (2010)Dynamic Scheduling of a Multiclass Queue: Discount Optimality (1975)The c μ rule revisited (1985)Design of manufacturing systems using queueing models (1992)Monotonicity in Markov Reward and Decision Chains: Theory and Applications (2006)The Foreground–Background queue: A survey (2007)A Classified Bibliography of Research on Optimal Design and Control of Queues (1977)Analysis of SRPT scheduling (2001)Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)An Empirical Evaluation of Thompson Sampling (2011)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Introduction to Multi-Armed Bandits (2019)Learning to Optimize via Posterior Sampling (2014)A Tutorial on Thompson Sampling (2018)A unified framework for stochastic optimization (2018)A Basic Dynamic Routing Problem and Diffusion (1978)Resource Sharing for Efficiency in Traffic Systems (1981)When Does the Devil Make Work? An Empirical Study of the Impact of Workload on Worker Productivity (2014)A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems (2017)SRPT for multiserver systems (2018)Open problems in queueing theory inspired by datacenter computing (2021)
this work references cited by second hop

References

  • 1990Multi-Armed Bandit Allocation Indices.997 cited
  • 2011Multi‐Armed Bandit Allocation Indices685 cited
  • 1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline562 cited
  • 1978Queueing Systems, Volume 2: Computer Applications.550 cited
  • 2013Performance Modeling and Design of Computer Systems: Queueing Theory in Action495 cited
  • 1967Time-shared Systems366 cited
  • 2002Insensitivity in processor-sharing networks124 cited
  • 1989Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures102 cited
  • 2004A resource-allocation queueing fairness measure82 cited
  • 2014Multi‐Armed Bandits, Gittins Index, and its Calculation78 cited
  • 2009On the Gittins index in the M/G/1 queue72 cited
  • 1990On extremal service disciplines in single-stage queueing systems66 cited
  • 2007Beyond processor sharing62 cited
  • 2005Nearly insensitive bounds on SMART scheduling56 cited
  • 1972Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System49 cited
  • 2003

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

Mixed scheduling disciplines for network flows
47 cited

Cited by

No citing works inside the corpus for this window.