Sciweavers

Share
MST
2016

Upper Bounds on Number of Steals in Rooted Trees

3 years 14 days ago
Upper Bounds on Number of Steals in Rooted Trees
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 computation can be modeled by rooted trees. In particular, we show that if the computation with n processors starts with one processor having a complete k-ary tree of height h (and the remaining n − 1 processors having nothing), the maximum possible number of steals is n i=1(k − 1)i h i .
Charles E. Leiserson, Tao B. Schardl, Warut Suksom
Added 08 Apr 2016
Updated 08 Apr 2016
Type Journal
Year 2016
Where MST
Authors Charles E. Leiserson, Tao B. Schardl, Warut Suksompong
Comments (0)
books