| dc.contributor.author | Leiserson, Charles E. | |
| dc.contributor.author | Schardl, Tao Benjamin | |
| dc.contributor.author | Suksompong, Warut | |
| dc.date.accessioned | 2016-06-24T17:36:38Z | |
| dc.date.available | 2016-06-24T17:36:38Z | |
| dc.date.issued | 2015-02 | |
| dc.identifier.issn | 1432-4350 | |
| dc.identifier.issn | 1433-0490 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/103329 | |
| dc.description.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). | en_US |
| dc.publisher | Springer US | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/s00224-015-9613-9 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | Springer US | en_US |
| dc.title | Upper Bounds on Number of Steals in Rooted Trees | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Leiserson, Charles E. | en_US |
| dc.contributor.mitauthor | Schardl, Tao Benjamin | en_US |
| dc.relation.journal | Theory of Computing Systems | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2016-05-23T12:14:00Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer Science+Business Media New York | |
| dspace.orderedauthors | Leiserson, Charles E.; Schardl, Tao B.; Suksompong, Warut | en_US |
| dspace.embargo.terms | N | en |
| dc.identifier.orcid | https://orcid.org/0000-0003-0198-3283 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
