Upper Bounds on Number of Steals in Rooted Trees

Author(s)
Leiserson, Charles E.; Schardl, Tao Benjamin; Suksompong, Warut
Thumbnail
Download224_2015_9613_ReferencePDF.pdf (103.1Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
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 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 ∑ni=1(k−1)i(hi).
Date issued
2015-02
URI
http://hdl.handle.net/1721.1/103329
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Theory of Computing Systems
Publisher
Springer US
Citation
Leiserson, Charles E., Tao B. Schardl, and Warut Suksompong. "Upper Bounds on Number of Steals in Rooted Trees." Theory of Computing Systems (February 2016) 58:2, pp 223-240.
Version: Author's final manuscript
ISSN
1432-4350
1433-0490
Collections