Complete exchange in 2D meshes

Abstract
We propose a new algorithm called Cyclic Exchange for all-to-all personalized exchange in a 2D mesh. This algorithm fully interleaves communication in both dimensions of a mesh. We have compared by simulation the performance of this algorithm with that of the Quadrant Exchange method previously proposed by S.H. Bokhari and H. Berryman (1992). The results show that the new algorithm is faster for the range of machine size, problem size and startup/transmission ratio.

This publication has 3 references indexed in Scilit: