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
OpenMP task scheduling strategies for multicore NUMA systems
TL;DR: This work extended the open source Qthreads threading library to implement different scheduler designs, accepting OpenMP programs through the ROSE compiler and demonstrates speedup and absolute performance superior to both the Intel and GNU OpenMP run-time systems.
Proceedings ArticleDOI
Fast and concurrent RDF queries with RDMA-based distributed graph exploration
TL;DR: Evaluation on a 6-node RDMA-capable cluster shows that Wukong significantly outperforms state-of-the-art systems like TriAD and Trinity, and proposes a worker-obliger model for efficient load balancing.
Proceedings Article
The case for tiny tasks in compute clusters
Kay Ousterhout,Aurojit Panda,Joshua Rosen,Shivaram Venkataraman,Reynold Xin,Sylvia Ratnasamy,Scott Shenker,Ion Stoica +7 more
TL;DR: It is argued for breaking data-parallel jobs in compute clusters into tiny tasks that each complete in hundreds of milliseconds, and a 5.2× improvement in response times is demonstrated due to the use of smaller tasks.
Journal ArticleDOI
Computing with Nearby Mobile Devices: A Work Sharing Algorithm for Mobile Edge-Clouds
TL;DR: This paper presents a work-sharing model, called Honeybee, using an adaptation of the well-known work stealing method to load balance independent jobs among heterogeneous mobile nodes, able to accommodate nodes randomly leaving and joining the system.
Proceedings ArticleDOI
Load balancing and locality in range-queriable data structures
TL;DR: Though this mechanism is specifically designed to improve the performance of skip graphs, it can be adapted to provide deterministic, locality-preserving load-balancing to any distributed data structure that orders machines in a ring or line.
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.