efficient deadlock-free fault-tolerant routing in prdt network for networks-on-chip designs
文献类型：期刊论文
| 作者 | Duan Xinming ; Wu Jigang |
| 刊名 | Journal of Computational Information Systems
 |
| 出版日期 | 2012 |
| 卷号 | 8期号:16页码:6963-6970 |
| 关键词 | Algorithms Fault tolerance Routing algorithms |
| ISSN号 | 1553-9105 |
| 中文摘要 | Fault tolerance is one of the most dominant issues for NoC systems. PRDT-based interconnection network is constructed by recursively overlaying 2-D diagonal meshes (torus). A PRDT network with two ranks has been proposed for NoC designs. In this paper, we present and compare two deadlockfree fault tolerant routing algorithms for PRDT topology NoC. The first algorithm is an extension of planar adaptive routing algorithm. It routes messages in PRDT networks under individual failures. The second algorithm employs a hierarchical fault model which converts a fault region into a rectangular in shape on different rank of PRDT structure. The proposed hierarchical fault tolerant routing algorithm routes messages under multiple failures. It only uses three extra virtual channels. As a result, a routing message can certainly find a path between any pairs of non-faulty nodes, if the network does not break by fault regions. The result of simulation shows that both of the proposed algorithms are of feasibility of gracefully degraded operation. The hierarchical fault tolerant routing algorithm provides superior performance as compared to the planar fault tolerant routing algorithm in all traffic cases. © 2012 Binary Information Press. |
| 英文摘要 | Fault tolerance is one of the most dominant issues for NoC systems. PRDT-based interconnection network is constructed by recursively overlaying 2-D diagonal meshes (torus). A PRDT network with two ranks has been proposed for NoC designs. In this paper, we present and compare two deadlockfree fault tolerant routing algorithms for PRDT topology NoC. The first algorithm is an extension of planar adaptive routing algorithm. It routes messages in PRDT networks under individual failures. The second algorithm employs a hierarchical fault model which converts a fault region into a rectangular in shape on different rank of PRDT structure. The proposed hierarchical fault tolerant routing algorithm routes messages under multiple failures. It only uses three extra virtual channels. As a result, a routing message can certainly find a path between any pairs of non-faulty nodes, if the network does not break by fault regions. The result of simulation shows that both of the proposed algorithms are of feasibility of gracefully degraded operation. The hierarchical fault tolerant routing algorithm provides superior performance as compared to the planar fault tolerant routing algorithm in all traffic cases. © 2012 Binary Information Press. |
| 收录类别 | EI |
| 语种 | 英语 |
| 公开日期 | 2013-09-17 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15024]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Duan Xinming,Wu Jigang. efficient deadlock-free fault-tolerant routing in prdt network for networks-on-chip designs[J]. Journal of Computational Information Systems,2012,8(16):6963-6970. |
| APA | Duan Xinming,&Wu Jigang.(2012).efficient deadlock-free fault-tolerant routing in prdt network for networks-on-chip designs.Journal of Computational Information Systems,8(16),6963-6970. |
| MLA | Duan Xinming,et al."efficient deadlock-free fault-tolerant routing in prdt network for networks-on-chip designs".Journal of Computational Information Systems 8.16(2012):6963-6970. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。