Generalized Hyper-Systolic Algorithm
Abstract
We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with np processors. For a problem of size V the communication complexity of the hyper-systolic algorithm is proportional to npV, to be compared with npV 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.