All-to-All Communication on the Connection Machine CM-200
Detailed algorithms for all-to-all broadcast and reduction are given for arrays mapped by binary or binary-reflected Gray code encoding to the processing nodes of binary cube networks. Algorithms are also given for the local computation of the array indices for the communicated data, thereby reducin...
Main Authors: | Kapil K. Mathur, S. Lennart Johnsson |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
1995-01-01
|
Series: | Scientific Programming |
Online Access: | http://dx.doi.org/10.1155/1995/637864 |
Similar Items
-
POLYSHIFT Communications Software for the Connection Machine System CM-200
by: William George, et al.
Published: (1994-01-01) -
All-to-all communication with low communication cost
by: Wan, Jun, S.M. Massachusetts Institute of Technology
Published: (2019) -
Quantum annealing with all-to-all connected nonlinear oscillators
by: Shruti Puri, et al.
Published: (2017-06-01) -
All-to-all personalized communication on generalized hypercubes
by: 施金鐘
Published: (1992) -
Optimizing All-to-All and Allgather Communications on GPGPU Clusters
by: Singh, Ashish Kumar
Published: (2012)