Parallel load balancing is studied for problems with certain bisection properties. A class of problems has :-bisectors if every problem p of weight w( p) in the class can be subdivided into two subproblems whose weight (load) is at least an :-fraction of the original problem. A problem p is to be sp
Parallel randomized load balancing
โ Scribed by Micah Adler; Soumen Chakrabarti; Michael Mitzenmacher; Lars Rasmussen
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 313 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
โฆ Synopsis
It is well known that after placing n balls independently and uniformly at
ลฝ
. random into n bins, the fullest bin holds โฐ log nrlog log n balls with high probability. More recently, Azar et al. analyzed the following process: randomly choose d bins for each ball, and then place the balls, one by one, into the least full bin from its d choices. Azar et al. They show that after all n balls have been placed, the fullest bin contains only ลฝ . log log nrlog dq โฐ 1 balls with high probability. We explore extensions of this result to parallel and distributed settings. Our results focus on the tradeoff between the amount of
๐ SIMILAR VOLUMES
We describe an adaptive method for achieving load balance in parallel computations simulating phenomena which are distributed over a spatially extended region, but are local in nature. We have tested the method on standard short-ranged parallel molecular dynamics calculations. The performance gain w
Using a workstation cluster for parallel program development requires consideration of various factors to optimise the mapping of the algorithm to the characteristics of the environment. In this paper we present a new analysis and verification of well-known ideas in parallel programming research of
## Abstract Parallel processing techniques have been used in the past to provide high performance computing resources for activities such as Computational Fluid Dynamics. This is normally achieved using specialized hardware and software, the expense of which would be difficult to justify for many f
The paper presents some adaptive load balance techniques for the simulation of rarefied gas flows on parallel computers. It is shown that a static load balance is insufficient to obtain a scalable parallel efficiency. Hence, two adaptive techniques are investigated which are based on simple algorith