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
Shared-Memory Parallel Maximal Biclique Enumeration
TL;DR: An improved sequential algorithm FMBE is developed, through "sequentializing" ParMBE, which scales well up to 64 cores, and is significantly faster than current parallel algorithms.
Posted Content
Near Optimal Coded Data Shuffling for Distributed Learning
Mohamed Adel Attia,Ravi Tandon +1 more
TL;DR: In this article, the authors present an information theoretic lower bound on the communication overhead for distributed data shuffling as a function of the underlying problem parameters (number of workers, number of data points, and the available storage, $S$ per node).
Proceedings ArticleDOI
Location-based memory fences
TL;DR: The software experiments show that applications can benefit from using location-based memory fences, but they do not scale as well in some cases, due to the software overhead, and suggest that a hardware support for location- based memory fences is worth considering.
Journal ArticleDOI
Fast and compact planar embeddings
Leo Ferres,José Fuentes-Sepúlveda,Travis Gagie,Travis Gagie,Meng He,Gonzalo Navarro,Gonzalo Navarro +6 more
TL;DR: This paper shows how to add a sublinear number of bits to Turan’s representation of planar graphs such that it supports fast navigation, thus overcoming this disadvantage.
Journal ArticleDOI
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling
TL;DR: Prism-R is presented, a variation of Prism that executes dynamic data-graph computations deterministically even when updates modify global variables with associative operations, and is only marginally slower than Prism.
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.