Upper Bounds on Number of Steals in Rooted Trees
Reads0
Chats0
TLDR
In this article, the authors studied the problem of work stealing in multithreaded computations and obtained tight upper bounds on the number of steals when the computation can be modeled by rooted trees.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 $\sum_{i=1}^n(k-1)^i\binom{h}{i}$.read more
Citations
More filters
Proceedings ArticleDOI
An Arithmetic for Rooted Trees.
TL;DR: The operations of tree addition, multiplication, and stretch are defined, proven, and proved, and it is shown that all trees can be generated from a starting tree of one vertex, thus defining prime trees with respect to addition and multiplication.
On the efficiency of localized work stealing
TL;DR: This paper investigates a variant of the work-stealing algorithm that it is shown that under the “even distribution of free agents assumption”, the expected running time of the algorithm is T 1 / P + O ( T ∞ lg P ) and gets another running-time bound based on ratios between the sizes of serial tasks in the computation.
References
More filters
Journal ArticleDOI
Scheduling multithreaded computations by work stealing
TL;DR: This paper gives the first provably good work-stealing scheduler for multithreaded computations with dependencies, and shows that the expected time to execute a fully strict computation on P processors using this scheduler is 1:1.
Journal ArticleDOI
On some techniques useful for solution of transportation network problems
TL;DR: An efficient algorithm for solving transportation problems that requires at most n3 additions and comparisons when applied to an n-by-n assignment problem, as compared with the theoretical upper bound proportional to n4 for the number of such operations required by currently available methods.
Proceedings ArticleDOI
Implementation of multilisp: Lisp on a multiprocessor
TL;DR: Multilisp is an extension of Lisp (more specifically, of the Lisp dialect Scheme) with additional operators and additional semantics to deal with parallel execution with novel techniques used for task scheduling and garbage collection.
Journal ArticleDOI
Randomized parallel algorithms for backtrack search and branch-and-bound computation
Richard M. Karp,Yanjun Zhang +1 more
TL;DR: Universal randomized methods for parallelizing sequential backtrack search and branch-and-bound computation are presented and demonstrate the effectiveness of randomization in distributed parallel computation.
Proceedings ArticleDOI
An empirical evaluation of work stealing with parallelism feedback
TL;DR: Simulation studies confirm with simulation studies that A-STEAL performs well when scheduling adaptively parallel work-stealing jobs on large-scale multiprocessors and provide evidence that A.STEAL consistently provides higher utilization than ABP for a variety of job mixes.