All-to-All Communication on the Connection Machine CM-200
Mathur, Kapil K.
Johnsson, S. Lennart
MetadataShow full item record
CitationMathur, Kapil K. and S. Lennart Johnsson. All-to-All Communication on the Connection Machine CM-200. Harvard Computer Science Group Technical Report TR-02-93.
AbstractDetailed 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 reducing the demand for communications bandwidth. For the Connection Machine system CM-200, Hamiltonian cycle based all-to-all communication algorithms yield a performance that is a factor of two to ten higher than the performance offered by algorithms based on trees, butterfly networks, or the Connection Machine router. The peak data rate achieved for all-to-all broadcast on a 2048 node Connection Machine system CM-200 is 5.4 Gbytes/sec when no recording is required. If the time for data reordering is included, then the effective peak data rate is reduced to 2.5 Gbytes/sec.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:23518805
- FAS Scholarly Articles