On the efficiency of localized work stealing
This paper investigates a variant of the work-stealing algorithm that we call the localized work-stealing algorithm. The intuition behind this variant is that because of locality, processors can benefit from working on their own work. Consequently, when a processor is free, it makes a steal attempt...
Main Authors: | Suksompong, Warut, Leiserson, Charles E, Schardl, Tao Benjamin |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Elsevier
2019
|
Online Access: | http://hdl.handle.net/1721.1/120140 https://orcid.org/0000-0001-6386-5552 https://orcid.org/0000-0003-0198-3283 |
Similar Items
-
Upper Bounds on Number of Steals in Rooted Trees
by: Leiserson, Charles E., et al.
Published: (2016) -
Upper bounds on number of steals in rooted trees
by: Leiserson, C, et al.
Published: (2015) -
Bounds on multithreaded computations by work stealing
by: Suksompong, Warut
Published: (2014) -
Executing Task Graphs Using Work-Stealing
by: Agrawal, Kunal, et al.
Published: (2012) -
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
by: Leiserson, Charles E., et al.
Published: (2016)