Hyper-systolic parallel computing

Thomas Lippert

doi:10.1109/71.663861

Hyper-systolic parallel computing

1998-01-01

13

PRE

AI

DOI：10.1109/71.663861

Original

Original request for help

Save

Abstract

En 中文

We introduce a new class of parallel algorithms for the exact computation of systems with pairwise mutual interactions of n elements, so called n(2)-problems. Hitherto, practical conventional parallelization strategies could ach eve a complexity of O(np) with respect to the inter-processor communication, p being the number of processors. Our new approach can reduce the interprocessor communication complexity to a number O(np(1/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 n(2)-problem, on the GRAY 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.

Keywords:

systolic algorithm

hyper-systolic algorithm

n-body computation

n(2)-loop computation

parallel computer

connection machine CM5 and Cray T3D

novel complexity class

Hyper-systolic parallel computing

Abstract

AI Summary

Journal

Organization