Large-scale heterogeneous distributed computing environments (such as Computational Grids and Clouds) offer the promise of access to a vast amount of computing resources at a relatively low cost. In order to ease the application development and deployment on such complex environments, high-level parallel programming languages exist that need to be supported by sophisticated runtime systems. One of the main problems that these runtime systems need to address is dynamic load balancing that ensures that no resources in the environment are underutilised or overloaded with work. This thesis deals with the problem of obtaining good speedups for irregular applications on heterogeneous distributed computing environments. It focuses on workstealing ...
In this chapter, we present a methodology for efficient load balancing of computational problems tha...
International audienceWork-stealing schedulers are common in shared memory environments. However, la...
This paper addresses the problem of efficiently supporting parallelism within a managed runtime. A p...
Good scheduling is important for ensuring effective use of Grid resources, while maximising parallel...
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&...
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...
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a k...
In this paper, we study the problem of dynamic load-balancing on heterogeneous hierarchical platform...
International audiencedynamic load-balancing on hierarchical platforms. In particular, we consider a...
Lazy-task creation is an efficient method of overcoming the overhead of the grain-size problem in pa...
In this paper, we consider a generic model of computational grids, seen as several clusters of homog...
International audienceIn a parallel computing context, peak performance is hard to reach with irregu...
International audienceThe scalability of high-performance, parallel iterative applications is direct...
In this chapter, we present a methodology for efficient load balancing of computational problems tha...
International audienceWork-stealing schedulers are common in shared memory environments. However, la...
This paper addresses the problem of efficiently supporting parallelism within a managed runtime. A p...
Good scheduling is important for ensuring effective use of Grid resources, while maximising parallel...
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&...
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...
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a k...
In this paper, we study the problem of dynamic load-balancing on heterogeneous hierarchical platform...
International audiencedynamic load-balancing on hierarchical platforms. In particular, we consider a...
Lazy-task creation is an efficient method of overcoming the overhead of the grain-size problem in pa...
In this paper, we consider a generic model of computational grids, seen as several clusters of homog...
International audienceIn a parallel computing context, peak performance is hard to reach with irregu...
International audienceThe scalability of high-performance, parallel iterative applications is direct...
In this chapter, we present a methodology for efficient load balancing of computational problems tha...
International audienceWork-stealing schedulers are common in shared memory environments. However, la...
This paper addresses the problem of efficiently supporting parallelism within a managed runtime. A p...