Computer simulation of liquids
Computer simulation of liquids
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Systolic Parallel Processing
Hyper-systolic algorithms with applications in linear algebra and molecular dynamics
Highly parallel computaions
Journal of Computational Physics
| Hi-index | 0.01 |
We introduce a new class of parallel algorithms for the exact computation of systems with pairwise mutual interactions of n elements, so called n2-problems. Hitherto, practical conventional parallelization strategies could achieve a complexity of O(np) with respect to the inter-processor communication, p being the number of processors. Our new approach can reduce the inter-processor communication complexity to a number $O(np^{{{1 \over 2}}}).$ In the framework of Additive Number Theory, the determination of the optimal communication pattern can be formulated as h-range minimization problem that can be solved numerically. Based on a complexity model, the scaling behavior of the new algorithm is numerically tested on the connection machine CM5. As a real life example, we have implemented a fast code for globular cluster n-body simulations, a generic n2-problem, on the CRAY T3D, with striking success. Our parallel method promises to be useful in various scientific and engineering fields like polymer chain computations, protein folding, signal processing, and, in particular, for parallel level-3 BLAS.