基于死锁恢复的网格/环面网络容错路由算法

Lei Song, Du Xu, Guo Jiang, Qing Yao
{"title":"基于死锁恢复的网格/环面网络容错路由算法","authors":"Lei Song, Du Xu, Guo Jiang, Qing Yao","doi":"10.1109/ICCCAS.2007.6251615","DOIUrl":null,"url":null,"abstract":"In direct networks, such as mesh and torus, the switching capacity will increase as the number of components increase. But the fault probability of the network also increases with the increasing of components. This paper proposes a novel fault-tolerant algorithm, named as minimal misrouted adaptive routing (MMAR) which is based on true fully adaptive routing algorithm and deadlock recovery mechanism. Due to the high adaptability, MMAR can accommodate arbitrary shaped fault models using minimal number of virtual channels in each physical link. When encountering concave fault models, MMAR minimizes the length of the misrouted path by avoiding routing the message into the irrespective holes. Simulation results show that MMAR can work efficiently and achieve favorable performance.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MMAR:A deadlock recovery-based fault tolerant routing algorithm for mesh/torus networks\",\"authors\":\"Lei Song, Du Xu, Guo Jiang, Qing Yao\",\"doi\":\"10.1109/ICCCAS.2007.6251615\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In direct networks, such as mesh and torus, the switching capacity will increase as the number of components increase. But the fault probability of the network also increases with the increasing of components. This paper proposes a novel fault-tolerant algorithm, named as minimal misrouted adaptive routing (MMAR) which is based on true fully adaptive routing algorithm and deadlock recovery mechanism. Due to the high adaptability, MMAR can accommodate arbitrary shaped fault models using minimal number of virtual channels in each physical link. When encountering concave fault models, MMAR minimizes the length of the misrouted path by avoiding routing the message into the irrespective holes. Simulation results show that MMAR can work efficiently and achieve favorable performance.\",\"PeriodicalId\":218351,\"journal\":{\"name\":\"2007 International Conference on Communications, Circuits and Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Communications, Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCAS.2007.6251615\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Communications, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCAS.2007.6251615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在直接网络中,如网状网络和环面网络,交换容量将随着组件数量的增加而增加。但网络的故障概率也随着组件的增加而增加。本文提出了一种基于真完全自适应路由算法和死锁恢复机制的最小错路由自适应路由算法。由于具有较高的自适应性,MMAR可以在每个物理链路中使用最少的虚拟通道来适应任意形状的故障模型。当遇到凹故障模型时,MMAR通过避免将消息路由到无关孔中来最小化错误路由路径的长度。仿真结果表明,MMAR能够有效地工作并取得良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
MMAR:A deadlock recovery-based fault tolerant routing algorithm for mesh/torus networks
In direct networks, such as mesh and torus, the switching capacity will increase as the number of components increase. But the fault probability of the network also increases with the increasing of components. This paper proposes a novel fault-tolerant algorithm, named as minimal misrouted adaptive routing (MMAR) which is based on true fully adaptive routing algorithm and deadlock recovery mechanism. Due to the high adaptability, MMAR can accommodate arbitrary shaped fault models using minimal number of virtual channels in each physical link. When encountering concave fault models, MMAR minimizes the length of the misrouted path by avoiding routing the message into the irrespective holes. Simulation results show that MMAR can work efficiently and achieve favorable performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
DC Tolerance Analysis of Nonlinear Circuits Using Set-Valued Functions Mining Co-regulated Genes Using Association Rules Combined with Hash-tree and Genetic Algorithms MTIM for IEEE 802.11 DCF power saving mode The Total Dose Radiation Hardened MOSFET with Good High-temperatue Performance Partner choice based on beam search in wireless cooperative networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1