Upper Bounds on Number of Steals in Rooted Trees
Name
224_2015_9613_ReferencePDF.pdf
Size
103.14 KB
Format
Adobe PDF
Checksum (MD5)
2fca4805f67d8b954bad426560db8ec0
Author(s)
Leiserson, Charles E.
Schardl, Tao Benjamin
Suksompong, Warut
Date Issued
February 2015
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
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).
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00224-015-9613-9
