International audienceWe consider the problem of deterministic load balancing of tokens in the discrete model. A set of n processors is connected into a d-regular undirected network. In every time step, each processor exchanges some of its tokens with each of its neighbors in the network. The goal is to minimize the discrepancy between the number of tokens on the most-loaded and the least-loaded processor as quickly as possible. Rabani et al. (1998) present a general technique for the analysis of a wide class of discrete load balancing algorithms. Their approach is to characterize the deviation between the actual loads of a discrete balancing algorithm with the distribution generated by a related Markov chain. The Markov chain can also be r...
Abstract. The task of balancing dynamically generated work load occurs in a wide range of parallel a...
We present a new randomized diffusion-based algorithm for balancing indivisible tasks (tokens) on a ...
We design a general mathematical framework to analyze the properties of nearest neighbor balancing a...
International audienceWe consider the problem of deterministic load balancing of tokens in the discr...
We consider the problem of deterministic distributed load balancing of indivisible tasks in the disc...
The neighbourhood load balancing problem considers a network along with a distribution of tasks over...
We consider the neighbourhood load balancing problem. Given a network of processors and an arbitrary...
Abstract We develop a general technique for the quantitative analy-sis of iterative distributed load...
We develop a general technique for the quantitative analysis of iterative distributed load balancing...
. This paper presents an analysis of the following load balancing algorithm. At each step, each nod...
. This paper presents an analysis of the following load balancing algorithm. At each step, each nod...
We present the first analysis of a simple discrete diffusion scheme for dynamic load balancing. In e...
Nearest neighbor load balancing algorithms, like diffusion, are popular due to their simplicity, fle...
We consider the problem of dynamic load balancing in arbitrary (connected) networks on n nodes. Our ...
Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past...
Abstract. The task of balancing dynamically generated work load occurs in a wide range of parallel a...
We present a new randomized diffusion-based algorithm for balancing indivisible tasks (tokens) on a ...
We design a general mathematical framework to analyze the properties of nearest neighbor balancing a...
International audienceWe consider the problem of deterministic load balancing of tokens in the discr...
We consider the problem of deterministic distributed load balancing of indivisible tasks in the disc...
The neighbourhood load balancing problem considers a network along with a distribution of tasks over...
We consider the neighbourhood load balancing problem. Given a network of processors and an arbitrary...
Abstract We develop a general technique for the quantitative analy-sis of iterative distributed load...
We develop a general technique for the quantitative analysis of iterative distributed load balancing...
. This paper presents an analysis of the following load balancing algorithm. At each step, each nod...
. This paper presents an analysis of the following load balancing algorithm. At each step, each nod...
We present the first analysis of a simple discrete diffusion scheme for dynamic load balancing. In e...
Nearest neighbor load balancing algorithms, like diffusion, are popular due to their simplicity, fle...
We consider the problem of dynamic load balancing in arbitrary (connected) networks on n nodes. Our ...
Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past...
Abstract. The task of balancing dynamically generated work load occurs in a wide range of parallel a...
We present a new randomized diffusion-based algorithm for balancing indivisible tasks (tokens) on a ...
We design a general mathematical framework to analyze the properties of nearest neighbor balancing a...