Abstract

The implementation of complete exchange on the circuit switched Intel iPSC-860 hypercube is described. This pattern, also known as all-to-all personalized communication, is the densest requirement that can be imposed on a network. On the iPSC-860, care needs to be taken to avoid edge contention, which can have a disastrous impact on communication time. There are basically two classes of algorithms that achieve contention-free complete exchange. The first contains the classical standard exchange algorithm that is generally useful for small message sizes. The second includes a number of optimal or near-optimal algorithms that are best for large messages. Measurements of communication overhead on the iPSC-860 are given and a notation for analyzing communication link usage is de-veloped. It is shown that for the two classes of algorithms, there is substantial variation in performance with synchronization technique

Citations

36	Algorithms for matrix transposition on boolean n-cube configured ensemble architecture - Johnsson, Ho - 1988
29	Communication overhead on the Intel iPSC-860 hypercube - Bokhari - 1990
2	Subtitle Report Documentation Page - Title