The Natural Work-Stealing Algorithm is Stable

DOI10.1137/S0097539701399551MaRDI QIDQ4429685zbMATH OpenFDO

Authors Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg

Publication date 28 September 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539701399551

zbMATH Keywords

stabilitydynamicwork-stealing

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Recommendations

• On the stability of dynamic diffusion load balancing
• Automata, Languages and Programming
• On the efficiency of localized work stealing
• A tighter analysis of work stealing
• Non-blocking steal-half work queues

Cited in

(11)

• Non-blocking steal-half work queues
• Load balancing via random local search in closed and open systems
• Self-stabilizing repeated balls-into-bins
• Performance analysis of work stealing strategies in large scale multi-threaded computing
• A tighter analysis of work stealing
• Analyses of load stealing models based on families of differential equations
• On the stability of dynamic diffusion load balancing
• On the efficiency of localized work stealing
• A dynamic-sized nonblocking work stealing deque
• Decentralized list scheduling
• Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input

This page was built for publication: The Natural Work-Stealing Algorithm is Stable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429685)