Upper Bounds on Number of Steals in Rooted Trees
Abstract 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 s...
Main Authors: | Leiserson, Charles E. (Contributor), Schardl, Tao Benjamin (Contributor), Suksompong, Warut (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer US,
2016-06-24T17:36:38Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On the efficiency of localized work stealing
by: Suksompong, Warut, et al.
Published: (2019) -
Bounds on multithreaded computations by work stealing
by: Suksompong, Warut
Published: (2014) -
Deterministic parallel random-number generation for dynamic-multithreading platforms
by: Leiserson, Charles E., et al.
Published: (2016) -
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)