Algorithms to enhance parallel performance of molecular dynamics simulations on parallel computers by dynamic load balancing are described. Load balancing is achieved by redistribution of work based on either a history of time spent computing per processor or on the number of pair interactions compu
ParList: A Parallel Data Structure for Dynamic Load Balancing
โ Scribed by Fabien Feschet; Serge Miguet; Laurent Perroton
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 703 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
๐ 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
## 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
Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of a program. Although static load balancing can solve many problems (e.g., those caused by processor heterogeneity and nonuniform loops) for most regular applications, the