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).
展开▼
机译：为具有n（= n / sup 4 /）处理器（n = 2 / sup k /）的多网格网络提供了一种有效的完整交换算法，其中蠕虫路由作为在两个通信处理器之间传递的消息的方法。所提出的算法分别在多网拓扑中有效地使用长度N和2N的周期。完整交换所需的总时间是O（Mn / sup 5/4 / logn），其中m是消息长度（假设对所有消息都相同）。
展开▼
