arXiv · hep-lat/9509011
Generalized Hyper-Systolic Algorithm
Abstract
We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with $n_p$ processors. For a problem of size $V$ the communication complexity of the hyper-systolic algorithm is proportional to $\sqrt{n_p}V$, to be compared with $n_pV$ for the systolic case. The implementation technique is explained in detail and the example of the parallel matrix-matrix multiplication is tested on the Cray-T3D.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. Galli. 1995-09-08. Generalized Hyper-Systolic Algorithm. https://arxiv.org/abs/hep-lat/9509011
Cite the original work for its findings. Save a collection to share your selection of sources.