72 citations · 107 across the 7 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2018★ 7 cited
On the Efficiency of Localized Work Stealing
Warut Suksompong, Charles E. Leiserson, Tao B. Schardl
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,…
cs.DC2017★ 4 cited
Upper Bounds on Number of Steals in Rooted Trees
Charles E. Leiserson, Tao B. Schardl, Warut Suksompong
Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the…