Wormhole routing for complete exchange in multi-mesh
Mallika De, Bama Charan Kundu, Bhabani P. Sinha · 2002
An efficient complete exchange algorithm is presented for a multi mesh network having N (=n/sup 4/) processors (n=2/sup k/), with wormhole routing as the method of message passing between two communicating processors. The proposed algorithm effectively uses the cycles of length n and 2n respectively, present in the multi mesh topology. The total time required for complete exchange is O(mN/sup 5/4/logN), where m is the message length (assumed to be the same for all the messages).