Fault-tolerant routing in 2D tori or meshes using limited-global-safety information

D. Xiang, Ai Chen
{"title":"Fault-tolerant routing in 2D tori or meshes using limited-global-safety information","authors":"D. Xiang, Ai Chen","doi":"10.1109/ICPP.2002.1040878","DOIUrl":null,"url":null,"abstract":"A limited-global-safety-information-based metric called local safety is proposed to handle fault-tolerant routing in 2D tori (or meshes). Sufficient conditions for existence of a minimum feasible path between the source and destination is presented based on local safety information in a 2D torus network. An efficient heuristic function is defined to guide fault-tolerant routing inside a 2D torus network. Unlike the conventional methods based on the block fault model, our method does not disable any fault-free nodes and fault-free nodes inside a fault block can still be a source or a destination, which can greatly increase throughput and computational power of the system. Techniques for avoidance of deadlocks are introduced. Extensive simulation results are presented.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.2002.1040878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A limited-global-safety-information-based metric called local safety is proposed to handle fault-tolerant routing in 2D tori (or meshes). Sufficient conditions for existence of a minimum feasible path between the source and destination is presented based on local safety information in a 2D torus network. An efficient heuristic function is defined to guide fault-tolerant routing inside a 2D torus network. Unlike the conventional methods based on the block fault model, our method does not disable any fault-free nodes and fault-free nodes inside a fault block can still be a source or a destination, which can greatly increase throughput and computational power of the system. Techniques for avoidance of deadlocks are introduced. Extensive simulation results are presented.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于有限全局安全信息的二维环面或网格容错路由
提出了一种基于有限全局安全信息的局部安全度量来处理二维环面(或网格)中的容错路由。给出了二维环面网络中基于局部安全信息的最小可行路径存在的充分条件。定义了一个有效的启发式函数来指导二维环面网络内部的容错路由。与传统的基于块故障模型的方法不同,该方法不禁用任何无故障节点,故障块内的无故障节点仍然可以作为源节点或目的节点,从而大大提高了系统的吞吐量和计算能力。介绍了避免死锁的技术。给出了广泛的仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A system for monitoring and management of computational grids Distributed game-tree search using transposition table driven work scheduling Performance comparison of location areas and reporting centers under aggregate movement behavior mobility models Fault-tolerant routing in 2D tori or meshes using limited-global-safety information Partitioning unstructured meshes for homogeneous and heterogeneous parallel computing environments
×
引用
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