A tighter analysis of work stealing

DOI10.1007/978-3-642-17514-5_25MaRDI QIDQ3060782zbMATH OpenOpenAlexFDO

Authors Marc Tchiboukdjian, Nicolas Gast, Jean-Louis Roch, Julien Bernard, Denis Trystram

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/183602

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Decentralized list scheduling
• On the efficiency of localized work stealing
• Scheduling multithreaded computations by work stealing
• The Natural Work-Stealing Algorithm is Stable
• On the Expected Relative Performance of List Scheduling

Cited in

(8)

• The data locality of work stealing
• Scheduling computations with provably low synchronization overheads
• Scheduling multithreaded computations by work stealing
• Decentralized list scheduling
• The Natural Work-Stealing Algorithm is Stable
• Performance analysis of work stealing strategies in large-scale multithreaded computing
• Performance analysis of work stealing strategies in large scale multi-threaded computing
• On the efficiency of localized work stealing

Describes a project that uses

Uses Software

• KAAPI

This page was built for publication: A tighter analysis of work stealing

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