Upper Bounds on Number of Steals in Rooted Trees

Charles E. Leiserson, Tao B. Schardl, Warut Suksompong

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…