International audienceWork-stealing schedulers are common in shared memory environments. However, large scale distributed memory usage has been limited to specific ad-hoc implementations preventing a broader adoption. In this paper we introduce a new scalable work-stealing algorithm for distributed memory systems as well as our implementation as the TITUS_DLB library. It is based on Kleinberg’s small-world graph. It allows to control the communication patterns and associated runtime overheads while providing efficient heuristics for victim selection and results routing. To validate our approach, we present the DLB_Bench benchmark which emulates arbitrary workload distribution and imbalance characteristics. Finally, we compare TITUS_DLB to t...
Work Stealing has proved to be an effective method for load balancing regular divide-and-conquer (D&...
Work Stealing has proved to be an effective method for load balancing regular divide-and-conquer (D&...
Task-centric programming models offer a versatile method for exposing parallelism. Such programs are...
International audienceWork-stealing schedulers are common in shared memory environments. However, la...
International audienceThe scalability of high-performance, parallel iterative applications is direct...
International audiencedynamic load-balancing on hierarchical platforms. In particular, we consider a...
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a k...
Abstract—Load balancing techniques (e.g. work stealing) are important to obtain the best performance...
Large-scale heterogeneous distributed computing environments (such as Computational Grids and Clouds...
We evaluate four state-of-the-art work-stealing algorithms for distributed systems with non-uniform ...
We evaluate four state-of-the-art work-stealing algorithms for distributedsystems with non-uniform c...
In this paper, we study the problem of dynamic load-balancing on heterogeneous hierarchical platform...
The fork-join paradigm of concurrent expression has gained popularity in conjunction with work-steal...
Abstract — Load balancing techniques (e.g. work stealing) are important to obtain the best performan...
Lazy-task creation is an efficient method of overcoming the overhead of the grain-size problem in pa...
Work Stealing has proved to be an effective method for load balancing regular divide-and-conquer (D&...
Work Stealing has proved to be an effective method for load balancing regular divide-and-conquer (D&...
Task-centric programming models offer a versatile method for exposing parallelism. Such programs are...
International audienceWork-stealing schedulers are common in shared memory environments. However, la...
International audienceThe scalability of high-performance, parallel iterative applications is direct...
International audiencedynamic load-balancing on hierarchical platforms. In particular, we consider a...
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a k...
Abstract—Load balancing techniques (e.g. work stealing) are important to obtain the best performance...
Large-scale heterogeneous distributed computing environments (such as Computational Grids and Clouds...
We evaluate four state-of-the-art work-stealing algorithms for distributed systems with non-uniform ...
We evaluate four state-of-the-art work-stealing algorithms for distributedsystems with non-uniform c...
In this paper, we study the problem of dynamic load-balancing on heterogeneous hierarchical platform...
The fork-join paradigm of concurrent expression has gained popularity in conjunction with work-steal...
Abstract — Load balancing techniques (e.g. work stealing) are important to obtain the best performan...
Lazy-task creation is an efficient method of overcoming the overhead of the grain-size problem in pa...
Work Stealing has proved to be an effective method for load balancing regular divide-and-conquer (D&...
Work Stealing has proved to be an effective method for load balancing regular divide-and-conquer (D&...
Task-centric programming models offer a versatile method for exposing parallelism. Such programs are...