Journal article icon

Journal article

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 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) .
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/s00224-015-9613-9

Authors


Leiserson, CE More by this author
Schardl, TB More by this author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Publisher:
Springer Publisher's website
Journal:
Theory of Computing Systems Journal website
Volume:
58
Issue:
2
Pages:
223–240
Publication date:
2015-02-28
Acceptance date:
2015-02-17
DOI:
EISSN:
1433-0490
ISSN:
1432-4350
Pubs id:
pubs:922611
URN:
uri:4c491a8d-d2d2-46bf-9709-7becf249af52
UUID:
uuid:4c491a8d-d2d2-46bf-9709-7becf249af52
Local pid:
pubs:922611

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP