基于3维网格的最小路由算法

Adaptive Minimal Wormhole Routing for 3 - D Meshes

本文给出了一个基于网格的无死锁的完全适应性最小路由算法,该算法对于n维网格只需要4n-2个虚拟通道。另外,如果提供更多的虚拟通道,该路由算法能使用这些额外的通道使限制的数目更少。

A deadlock - free fully adaptive minimal routing algorithm for meshes is presented. This new algorithm requires only 4n - 2 virtual channels for an - dimensional mesh. In addition, if more than the minimum number of virtual channels are available, the routing algorithm can use these additional channels with the fewest possible number of restrictions.