A dynamic-sized nonblocking work stealing deque

DOI10.1007/s00446-005-0144-5zbMath1264.68035OpenAlexW2098905480MaRDI QIDQ1953649

Nir Shavit, Mark Moir, Danny Hendler, Yossi Lev

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 structuresload balancingconcurrent programmingwork stealinglock-free

Mathematics Subject Classification ID

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

Related Items (3)

A dynamic-sized nonblocking work stealing deque ⋮ 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

Cites Work

• Unnamed Item
• The data locality of work stealing
• DCAS-based concurrent deques
• A dynamic-sized nonblocking work stealing deque
• Scheduling multithreaded computations by work stealing
• Non-blocking steal-half work queues
• Thread scheduling for multiprogrammed multiprocessors

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