Complete exchange and broadcast algorithms for meshes

Two complete exchange algorithms for meshes are given. The modified quadrant exchange algorithm is based on the quadrant exchange algorithm and it is well suited for square meshes with a power of two rows and columns. The store-and-forward complete exchange algorithm is suitable for meshes of arbitrary size. A pipelined broadcast algorithm for meshes is also presented. This new algorithm, called the double hop broadcast, can broadcast long messages at slightly lower cost than the edge-disjoint fence algorithm because it uses routing trees of lower height. This shows that there is still room for improvement in the design of pipelined broadcast algorithms for meshes.<
>