Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

MST
2016

favoriteEmaildiscussreport

94views Hardware» more MST 2016»

Upper Bounds on Number of Steals in Rooted Trees

8 years 20 days ago

Upper Bounds on Number of Steals in Rooted Trees

Download cs.stanford.edu

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

Real-time Traffic

Hardware | MST 2016 |

claim paper

Related Content

» Bounding RightArm Rotation Distances

» Restricted rotation distance between binary trees

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» Gaussian Process Bandits for Tree Search

» A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials

» Constant Time per Edge is Optimal on Rooted Tree Networks

» Inorder traversal of splay trees

» Bounded Degree Closest kTree Power Is NPComplete

» Efficient Upper Body Pose Estimation from a Single Image or a Sequence

» Designing an A Algorithm for Calculating Edit Distance between RootedUnordered Trees

Post Info
More Details (n/a)

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)