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
Scheduling of Linear Algebra Kernels on Multiple Heterogeneous Resources
TL;DR: Experimental evaluation shows that the generalization of HeteroPrio to the case with several classes of heterogeneous workers is efficient even for highly heterogeneous configurations and significantly outperforms HEFT-based strategy.
Journal ArticleDOI
GWS—A Collaborative Load-Balancing Algorithm for Internet-of-Things
TL;DR: A collaborative load-balancing algorithm for the TS mechanism is proposed for FCNs, which is a variant of a work-stealing scheduling algorithm, and is based on the Nash bargaining solution for a cooperative game between FCNs.
Journal ArticleDOI
An approach for realistically simulating the performance of scientific applications on high performance computing systems
TL;DR: In this article, an approach to simulate computationally intensive scientific applications that employ dynamic loop self-scheduling (DLS) and execute on large and complex high performance computing (HPC) systems is presented.
Proceedings ArticleDOI
Load-balanced pipeline parallelism
TL;DR: A compiler-based technique automatically extracts the pipeline stages and executes them in a data parallel fashion, using token-based chunked synchronization to handle sequential stages and provides linear speedup for several applications.
Journal ArticleDOI
Framework for Improvement by Vertical Enhancement: A Simple Approach to Improve Representation of Low and High Level Clouds in Large Scale Models
TL;DR: In this paper, the authors proposed the Framework for Improvement by Vertical Enhancement (FIVE), which computes selected processes on a one-dimensional vertical grid with local high resolution in the boundary layer and near the tropopause.
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.