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
Journal ArticleDOI
Experiences with mesh-like computations using prediction binary trees ∗
TL;DR: Different measurements showing that tasks granularity is a key point for the performances of the decomposition/mapping strategy shows a good scalability, and improves performance in both cheaper commodity cluster and high performance clusters with low latency networks.
Proceedings ArticleDOI
DIDO: Dynamic Pipelines for In-Memory Key-Value Stores on Coupled CPU-GPU Architectures
TL;DR: This paper proposes DIDO, an in-memory key-value store system with dynamic pipeline executions on the coupled CPU-GPU architecture, to address the limitations and drawbacks of state-of-the-art system designs and develops a cost model guided adaption mechanism to determine the optimal pipeline configuration.
Posted Content
Combating Computational Heterogeneity in Large-Scale Distributed Computing via Work Exchange.
Mohamed Adel Attia,Ravi Tandon +1 more
TL;DR: A lower bound on the expected computation time based on the work-conservation principle is presented and the approach of work exchange is presented to combat the latency problem, in which faster workers can be reassigned additional leftover computations that were originally assigned to slower workers.
Journal ArticleDOI
Performance of heterogeneous computing with graphics processing unit and many integrated core for hartree potential calculations on a numerical grid
TL;DR: The performance enhancement by CPU + MIC was considerably lower than expected because of the large initialization overhead of MIC, although its theoretical performance is similar with that of CPU’s + GPU.
Journal ArticleDOI
Fairness in responsive parallelism
TL;DR: An algorithm designed to approximate the fairly prompt scheduling principle on multicore computers is presented, implemented by extending the Standard ML language, and an empirical evaluation is presented.
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.