The data locality of work stealing

DOI10.1007/s00224-002-1057-3zbMath1017.68010OpenAlexW1995873479MaRDI QIDQ1849578

Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe

Publication date: 1 December 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-002-1057-3

zbMATH Keywords

schedulinghardware-controlled shared-memory machines

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Scheduling computations with provably low synchronization overheads ⋮ The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation ⋮ On the efficiency of localized work stealing ⋮ A dynamic-sized nonblocking work stealing deque ⋮ Oracle-guided scheduling for controlling granularity in implicitly parallel languages ⋮ Performance driven distributed scheduling of parallel hybrid computations ⋮ The cache complexity of multithreaded cache oblivious algorithms ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Promoting cooperation in selfish computational grids

This page was built for publication: The data locality of work stealing