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
The impact factors on the competence of big data processing
Wei Li,William W. Guo,Michael Li +2 more
TL;DR: This paper proposes an ideal computing environment and injects impact factors into the running MapReduce to quantitatively evaluate how the performance is impaired, aiming at exposing the original impaired performance that the undedicated environment of VC can achieve under the impact.
Proceedings ArticleDOI
A load balancing method based on dynamic time step feedback
TL;DR: A dynamic load balancing method with a prediction and dynamic time step feedback was developed that showed significantly better adaptability and scalability compared to one that employs a static time step Feedback.
Posted Content
Parallel and Memory-limited Algorithms for Optimal Task Scheduling Using a Duplicate-Free State-Space.
Michael Orr,Oliver Sinnen +1 more
TL;DR: This paper investigates and proposes algorithms for the AO model and, for comparison, the older Exhaustive List Scheduling (ELS) state-space model and shows that AO gives a clear advantage to DFBnB and allows greater scalability for parallel search algorithms.
Proceedings ArticleDOI
RETHROTTLE: Execution throttling in the REDEFINE SoC architecture
A. N. Satrawala,S. K. Nandy +1 more
TL;DR: This work proposes and study the throttling of execution in REDEFINE to maximize the architecture efficiency and to expose abundant parallelism in applications.
Book ChapterDOI
Evaluating Dynamic Scheduling of Tasks in Mobile Architectures Using ParallelME Framework
Rodrigo Carvalho,Guilherme Andrade,Diogo Santana,Thiago Silveira,Daniel Madeira,Rafael Sachetto,Renato Ferreira,Leonardo Rocha +7 more
TL;DR: This paper extended the ParallelME framework by implementing and evaluating two different dynamic scheduling strategies, Heterogeneous Earliest Finish Time (HEFT) and Performance-Aware Multiqueue Scheduler (PAMS), and compares the proposals with the FCFS.
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.