Generalized Hyper-Systolic Algorithm
| dc.creator | Galli, A. | |
| dc.date | 1995-09-08 | |
| dc.date.accessioned | 2026-07-07T03:39:33Z | |
| dc.date.available | 2026-07-07T03:39:33Z | |
| dc.description | 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. | |
| dc.description | Latex | |
| dc.identifier | https://arxiv.org/abs/hep-lat/9509011 | |
| dc.identifier | http://arxiv.org/abs/hep-lat/9509011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/38976 | |
| dc.subject | High Energy Physics - Lattice | |
| dc.title | Generalized Hyper-Systolic Algorithm | |
| dc.type | text |