In this paper we consider several algorithms for exchanging data among processors in a hypercube network. The data transfer problems considered are those arising from classical numerical algorithms such as Gaussian elimination, conjugate gradient methods, and the N-body problem. We propose some estimates for the timings of the various algorithms which reveal that multiprocessors based on the hypercube topology can be very efficient in performing data exchange operations.
Bibliographical noteFunding Information:
* This work was supported in part by ONR Grant NO00 14-82-K-O 184 and in part by a joint study with IBM/Kingston.