In this paper we analyse a very simple dynamic work-stealing algorithm. In the work-generation model, there are n generators which are arbitrarily distributed among a set of n processors. During each time-step, with probability A, each generator generates a unit-time task which it inserts into the queue of its host processor. After the new tasks are generated, each processor removes one task from its queue and services it. Clearly, the work-generation model allows the load to grow more and more imbalanced, so, even when lambda < 1, the system load can be unbounded. The natural work-stealing algorithm that we analyse works as follows. During each time step, each empty processor sends a request to a randomly selected other processor. Any n...
This paper studies the performance of parallel stream computations on a multiprocessor architecture ...
This paper addresses the problem of efficiently supporting parallelism within a managed runtime. A p...
We present the first analysis of a simple discrete diffusion scheme for dynamic load balancing. In e...
In this paper we analyze a very simple dynamic work-stealing algorithm. In the work-generation model...
In this paper we analyze a very simple dynamic work-stealing algorithm. In the work-generation model...
In this paper, we consider a generic model of computational grids, seen as several clusters of homog...
This paper investigates a variant of the work-stealing algorithm that we call the localized work-ste...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Blumofe and Leiserson [6] gave the first provably good work-stealing work scheduler for mul-tithread...
International audienceIn this paper, we consider a generic model of computational grids, seen as sev...
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a k...
International audienceWe study the impact of communication latency on the classical Work Stealing lo...
We study the long term (steady state) performance of a simple, randomized, local load balancing tech...
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&...
This paper studies the performance of parallel stream computations on a multiprocessor architecture ...
This paper addresses the problem of efficiently supporting parallelism within a managed runtime. A p...
We present the first analysis of a simple discrete diffusion scheme for dynamic load balancing. In e...
In this paper we analyze a very simple dynamic work-stealing algorithm. In the work-generation model...
In this paper we analyze a very simple dynamic work-stealing algorithm. In the work-generation model...
In this paper, we consider a generic model of computational grids, seen as several clusters of homog...
This paper investigates a variant of the work-stealing algorithm that we call the localized work-ste...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Blumofe and Leiserson [6] gave the first provably good work-stealing work scheduler for mul-tithread...
International audienceIn this paper, we consider a generic model of computational grids, seen as sev...
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a k...
International audienceWe study the impact of communication latency on the classical Work Stealing lo...
We study the long term (steady state) performance of a simple, randomized, local load balancing tech...
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&...
This paper studies the performance of parallel stream computations on a multiprocessor architecture ...
This paper addresses the problem of efficiently supporting parallelism within a managed runtime. A p...
We present the first analysis of a simple discrete diffusion scheme for dynamic load balancing. In e...