摘要
提出一种基于2D-Mesh只使用2条虚通道的容错路由算法,少于需要4条虚通道的Boppana算法,以及需要3条虚通道的Duan算法。算法基于块故障模型,故障块可以是f-ring,也可以是f-chain。无故障时算法用最短路径路由消息,当消息被故障块阻塞时使用绕道策略进行路由。在不重叠和重叠故障区情况下分别给出算法无死锁性的证明过程。
A fault-tolerant routing algorithm for 2D-Mesh that uses only two virtual channels was presented. Previously,13oppana needs 4 virtual channels,and Duan needs 3 virtual channels. The algorithm is based on the block fault model The fault region can be f-ring and f-chain at the same time. Shortest paths are used for routing if there are no faults, while detour paths are used for blocked messages. We have proved that our algorithm is deadlock-free under the non-overlapping and overlapping situation.
出处
《计算机科学》
CSCD
北大核心
2012年第3期113-117,134,共6页
Computer Science
基金
国家自然科学基金项目(60873047
61070169)
江苏省自然科学基金项目(BK2008154)资助