A dynamic-sized nonblocking work stealing deque

DOI10.1007/S00446-005-0144-5MaRDI QIDQ1953649zbMATH OpenOpenAlexFDO

Authors Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit

Publication date 7 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-005-0144-5

zbMATH Keywords

data structureswork stealingload balancingconcurrent programminglock-free

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Distributed systems (68M14)

Recommendations

• Non-blocking steal-half work queues
• scientific article; zbMATH DE number 1696666
• On the efficiency of localized work stealing
• About optimal management of work-stealing deques in two-level memory
• The Natural Work-Stealing Algorithm is Stable

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A dynamic-sized nonblocking work stealing deque
• DCAS-based concurrent deques
• Non-blocking steal-half work queues
• Scheduling multithreaded computations by work stealing
• The data locality of work stealing
• Thread scheduling for multiprogrammed multiprocessors

Cited in

(4)

• Non-blocking steal-half work queues
• About optimal management of work-stealing deques in two-level memory
• The models and methods of optimal control of three work-stealing deques located in a shared memory
• A dynamic-sized nonblocking work stealing deque

This page was built for publication: A dynamic-sized nonblocking work stealing deque

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