Upper bounds on number of steals in rooted trees
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 wit...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Springer
2015
|