Journal ArticleDOI
Scheduling multithreaded computations by work stealing
TLDR
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.Abstract:
This paper studies the problem of efficiently schedulling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is “work stealing,” in which processors needing work steal computational threads from other processors. In this paper, we give the first provably good work-stealing scheduler for multithreaded computations with dependencies.Specifically, our analysis shows that the expected time to execute a fully strict computation on P processors using our work-stealing scheduler is T1/P + O(T ∞ , where T1 is the minimum serial execution time of the multithreaded computation and (T ∞ is the minimum execution time with an infinite number of processors. Moreover, the space required by the execution is at most S1P, where S1 is the minimum serial space requirement. We also show that the expected total communication of the algorithm is at most O(PT ∞( 1 + nd)Smax), where Smax is the size of the largest activation record of any thread and nd is the maximum number of times that any thread synchronizes with its parent. This communication bound justifies the folk wisdom that work-stealing schedulers are more communication efficient than their work-sharing counterparts. All three of these bounds are existentially optimal to within a constant factor.read more
Citations
More filters
Proceedings ArticleDOI
KAAPI: A thread scheduling runtime system for data flow computations on cluster of multi-processors
TL;DR: In this paper, an efficient work-stealing algorithm for a macro data flow computation based on minor extension of POSIX thread interface is proposed to exploit the computation resources of a multiprocessor cluster.
Proceedings ArticleDOI
Thread criticality predictors for dynamic performance, power, and resource management in chip multiprocessors
TL;DR: This paper proposes and evaluates simple but effective thread criticality predictors for parallel applications and shows that accurate predictors can be built using counters that are typically already available on-chip, and demonstrates two applications of the predictor.
Proceedings ArticleDOI
Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks
TL;DR: The federated scheduling algorithm proposed in this paper is a generalization of partitioned scheduling to parallel tasks and shows that if on unit-speed cores, a task set has total utilization of at most m and the critical-path length of each task is smaller than its deadline, then Federated scheduling can schedule that task set.
Proceedings ArticleDOI
Work-first and help-first scheduling policies for async-finish task parallelism
TL;DR: This paper introduces a new work-stealing scheduler with compiler support for async-finish task parallelism that can accommodate both work- first and help-first scheduling policies, and provides insights on scenarios in which the help- first policy yields better results than the work-first policy and vice versa.
Proceedings ArticleDOI
Scheduling threads for constructive cache sharing on CMPs
Shimin Chen,Phillip B. Gibbons,Michael Kozuch,Vasileios Liaskovitis,Anastassia Ailamaki,Guy E. Blelloch,Babak Falsafi,Limor Fix,Nikos Hardavellas,Todd C. Mowry,Christopher B. Wilkerson +10 more
TL;DR: This is the first paper demonstrating the effectiveness of PDF on real benchmarks, providing a direct comparison between PDF and WS, revealing the limiting factors for PDF in practice, and presenting an approach for overcoming these factors.
References
More filters
Journal ArticleDOI
Cilk: An Efficient Multithreaded Runtime System
Robert D. Blumofe,Christopher F. Joerg,Bradley C. Kuszmaul,Charles E. Leiserson,Keith H. Randall,Yuli Zhou +5 more
TL;DR: It is shown that on real and synthetic applications, the “work” and “critical-path length” of a Cilk computation can be used to model performance accurately, and it is proved that for the class of “fully strict” (well-structured) programs, the Cilk scheduler achieves space, time, and communication bounds all within a constant factor of optimal.
Journal ArticleDOI
Bounds for certain multiprocessing anomalies
TL;DR: In this paper, precise bounds are derived for several anomalies of this type in a multiprocessing system composed of many identical processing units operating in parallel, and they show that an increase in the number of processing units can cause an increased total length of time needed to process a fixed set of tasks.
Proceedings ArticleDOI
The implementation of the Cilk-5 multithreaded language
TL;DR: Cilk-5's novel "two-clone" compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler are presented.
Journal ArticleDOI
The Parallel Evaluation of General Arithmetic Expressions
TL;DR: It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.