T w o complete exchange algorithms f o r meshes are given. The modified quadrant exchange algorithm is based on the quadrant exchange algorithm and it is well suited f o r square meshes with a power of two rows and columns. The store-and-forward complete exchange algorithm i s suitable f o r meshes of' arbitrary size. A pipelined broadcast algorithm f o r meshes is also presented. This new algorithm, called ihe 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 f o r meshes422 0-8186-5680494 $03.00 0 1994 IEEE