SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Load Balancing Guardrails
16 references·0 citing·38 second hop
Load Balancing Guardrails (2019)Load Balancing GuardrailsPerformance Modeling and Design of Computer Systems: Queueing Theory in Action (2013)Performance Modeling and Desi…Asymptotic independence of queues under randomized load balancing (2012)Asymptotic independence of qu…Size- and state-aware dispatching problem with queue-specific job sizes (2011)Size- and state-aware dispatc…Multi‐Armed Bandit Allocation Indices (2011)Multi‐Armed Bandit Allocation…Load balancing in processor sharing systems (2010)Load balancing in processor s…On the Gittins index in the M/G/1 queue (2009)On the Gittins index in the M…Analysis of join-the-shortest-queue routing for web server farms (2007)Analysis of join-the-shortest…Optimal state-free, size-aware dispatching for heterogeneous -type systems (2005)Optimal state-free, size-awar…Nearly insensitive bounds on SMART scheduling (2005)Nearly insensitive bounds on …Insensitive load balancing (2004)Insensitive load balancingClassifying scheduling policies with respect to unfairness in an M/GI/1 (2003)Classifying scheduling polici…Optimal Load Balancing on Distributed Homogeneous Unreliable Processors (1998)Optimal Load Balancing on Dis…Multi-Armed Bandit Allocation Indices (1989)Multi-Armed Bandit Allocation…Poisson Arrivals See Time Averages (1982)Poisson Arrivals See Time Ave…On the optimal assignment of customers to parallel servers (1978)On the optimal assignment of …Optimality of the shortest line discipline (1977)Optimality of the shortest li…Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)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)Fluid Limits for Shortest Remaining Processing Time Queues (2009)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)A simple dynamic routing problem (1980)Control Techniques for Complex Networks (2007)Markov Models & Optimization (1993)The power of two choices in randomized load balancing (2001)Pull-based load distribution in large-scale heterogeneous service systems (2014)Pull-based load distribution in large-scale heterogeneous service systems (2015)The Power of Slightly More than One Sample in Randomized Load Balancing (2017)A class of games possessing pure-strategy Nash equilibria (1973)Potential Games (1996)Worst-Case Equilibria (1999)Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems (2015)On the scheduling of operations in a chat contact center (2018)Scalable Load Balancing in Networked Systems: A Survey of Recent Advances (2022)Point Processes and Queues (1981)Universality of Power-of-$d$ Load Balancing in Many-Server Systems (2016)Universality of Power-of-d Load Balancing in Many-Server Systems (2018)Optimal control of two interacting service stations (1984)Optimal control of admission to a quenching system (1985)Optimal control of service rates in networks of queues (1987)A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance (1986)Queueing systems with vacations ? A survey (1986)Telephone Call Centers: Tutorial, Review, and Research Prospects (2003)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Introduction to Multi-Armed Bandits (2019)Bandit Algorithms (2020)Finite-time Analysis of the Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Simulation optimization: a review of algorithms and applications (2015)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

  • 1982Poisson Arrivals See Time Averages1,220 cited
  • 2011Multi‐Armed Bandit Allocation Indices686 cited
  • 1977Optimality of the shortest line discipline495 cited
  • 2013Performance Modeling and Design of Computer Systems: Queueing Theory in Action495 cited
  • 1978On the optimal assignment of customers to parallel servers337 cited
  • 1989Multi-Armed Bandit Allocation Indices280 cited
  • 2007Analysis of join-the-shortest-queue routing for web server farms219 cited
  • 2003Classifying scheduling policies with respect to unfairness in an M/GI/1170 cited
  • 2012Asymptotic independence of queues under randomized load balancing161 cited
  • 2010Load balancing in processor sharing systems96 cited
  • 2005Optimal state-free, size-aware dispatching for heterogeneous -type systems85 cited
  • 2009On the Gittins index in the M/G/1 queue72 cited
  • 1998Optimal Load Balancing on Distributed Homogeneous Unreliable Processors58 cited
  • 2005Nearly insensitive bounds on SMART scheduling56 cited
  • 2011Size- and state-aware dispatching problem with queue-specific job sizes54 cited
  • 2004

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

Insensitive load balancing
50 cited

Cited by

No citing works inside the corpus for this window.