The Natural Work-Stealing Algorithm is Stable
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 32 (5), 1260-1279
- https://doi.org/10.1137/s0097539701399551
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov FunctionsThe Annals of Applied Probability, 2001
- An Improved Stability Bound for Binary Exponential BackoffTheory of Computing Systems, 2001
- Virtual data space – load balancing for irregular applicationsParallel Computing, 2000
- Analysis of Practical Backoff Protocols for Contention Resolution with Multiple ServersJournal of Computer and System Sciences, 1999
- Analysis of Backoff Protocols for Multiple Access ChannelsSIAM Journal on Computing, 1996
- Cilk: An Efficient Multithreaded Runtime SystemJournal of Parallel and Distributed Computing, 1996
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- Topics in the Constructive Theory of Countable Markov ChainsPublished by Cambridge University Press (CUP) ,1995
- Markov Chains and Stochastic StabilityPublished by Springer Science and Business Media LLC ,1993
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982