Upper Bounds on Number of Steals in Rooted Trees

Autor:	Leiserson, Charles E., Schardl, Tao B., Suksompong, Warut
Rok vydání:	2017
Předmět:	Computer Science - Distributed Parallel and Cluster Computing Computer Science - Discrete Mathematics Computer Science - Data Structures and Algorithms
Zdroj:	Theory of Computing Systems, 58(2):223-240 (2016)
Druh dokumentu:	Working Paper
DOI:	10.1007/s00224-015-9613-9
Popis:	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 $\sum_{i=1}^n(k-1)^i\binom{h}{i}$. Comment: 18 pages, 5 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1706.03184 Zobrazit plný text záznamu View this record from Arxiv