Fault-Tolerant Adaptive Routing Algorithm for 2D Torus Network

Y. Miura, Tsukasa-Pierre Nakao, Naohisa Fukase
{"title":"Fault-Tolerant Adaptive Routing Algorithm for 2D Torus Network","authors":"Y. Miura, Tsukasa-Pierre Nakao, Naohisa Fukase","doi":"10.14738/TNC.71.6032","DOIUrl":null,"url":null,"abstract":"A 2D torus network is one of the most popular networks for parallel processing. We have researched the North-South First (NSF) routing which is applicable to a 2D torus and combines the north-first (NF) and south-first (SF) methods.  We focused on the proposal of a routing algorithm aimed at avoiding congestion of the crowded network. It was superior in congestion tolerance but not in fault tolerance. We have therefore been researching algorithms considering fault tolerance of the NSF method. In this paper we propose an NSF-FT method which is a new routing algorithm with improved fault tolerance. We evaluated the congestion resistance and fault tolerance of the proposed method by dynamic communication performance evaluation by simulation. The software simulation showed that the proposed algorithm has higher performance.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Networks and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14738/TNC.71.6032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A 2D torus network is one of the most popular networks for parallel processing. We have researched the North-South First (NSF) routing which is applicable to a 2D torus and combines the north-first (NF) and south-first (SF) methods.  We focused on the proposal of a routing algorithm aimed at avoiding congestion of the crowded network. It was superior in congestion tolerance but not in fault tolerance. We have therefore been researching algorithms considering fault tolerance of the NSF method. In this paper we propose an NSF-FT method which is a new routing algorithm with improved fault tolerance. We evaluated the congestion resistance and fault tolerance of the proposed method by dynamic communication performance evaluation by simulation. The software simulation showed that the proposed algorithm has higher performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二维环面网络的容错自适应路由算法
二维环面网络是目前最流行的并行处理网络之一。研究了一种适用于二维环面的南北优先路由(NSF),它结合了北优先(NF)和南优先(SF)方法。我们重点提出了一种路由算法,旨在避免拥挤网络的拥塞。它的拥塞容忍度较好,但容错能力较差。因此,我们一直在研究考虑NSF方法容错的算法。本文提出了一种新的路由算法NSF-FT,该算法具有较好的容错性。通过仿真动态通信性能评估,对该方法的抗拥塞性和容错性进行了评估。软件仿真结果表明,该算法具有较高的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Photosynthesis Productivity Improvement Efficiency and Yield in Salt Soils Prediction, by Mathematical Model, of the Effects of Hydration for Germination at Different Times and Temperatures on the Nutritional and Functional Characteristics of Chickpea Flour (Cicer Arietinum L.) Liposomes vs. Probiosomes: A Novel Approach for Targeted Drug Delivery The Impact of Climate and Soil Temperature Warming on Viticulture in Southern Finland, The Baltic Sea Region, and a Few Regions in Central Europe Molecular Fingerprinting Confirms Pollen-Proofing of Nonwoven Pollination Control Fabrics in Sugar Beet
×
引用
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