We present a routing emulator for the distributed permutation problem on SIMD parallel systems, not equipped with hardware routing facilities and restricted to a nearest neighbour connectivity. The novel method is based on the hyper-systolic algorithm. We discuss its implementation on APE100/Quadrics and present bandwidth measurements. © 1998 Elsevier B.V.
Hyper-systolic routing for SIMD systems
Palazzari, P.
1998-01-01
Abstract
We present a routing emulator for the distributed permutation problem on SIMD parallel systems, not equipped with hardware routing facilities and restricted to a nearest neighbour connectivity. The novel method is based on the hyper-systolic algorithm. We discuss its implementation on APE100/Quadrics and present bandwidth measurements. © 1998 Elsevier B.V.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
