Fault-tolerant multiprocessor system routing using incomplete diagnostic information

D. Blough, S. Najand
{"title":"Fault-tolerant multiprocessor system routing using incomplete diagnostic information","authors":"D. Blough, S. Najand","doi":"10.1109/IPPS.1992.223013","DOIUrl":null,"url":null,"abstract":"Fault-tolerant routing algorithms in multiprocessor systems utilize diagnostic information in selecting paths for messages. In many situations, only incomplete, or partial, diagnostic information is available for this purpose. The authors present algorithms for achieving two forms of diagnosis, known as k-reachability diagnosis and k-neighborhood diagnosis which provide partial diagnostic information. They compare, both analytically and through experiments conducted on an Intel iPSC/2 hypercube the performance and overhead of these two algorithms. They also present a routing algorithm that successfully routes messages between connected non-faulty nodes in systems of arbitrary topology containing an arbitrary number of faults. The performance of the algorithm is shown to be optimal when k=n-1 and within a factor of two of optimal, in the worst case, when k=1.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Sixth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1992.223013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Fault-tolerant routing algorithms in multiprocessor systems utilize diagnostic information in selecting paths for messages. In many situations, only incomplete, or partial, diagnostic information is available for this purpose. The authors present algorithms for achieving two forms of diagnosis, known as k-reachability diagnosis and k-neighborhood diagnosis which provide partial diagnostic information. They compare, both analytically and through experiments conducted on an Intel iPSC/2 hypercube the performance and overhead of these two algorithms. They also present a routing algorithm that successfully routes messages between connected non-faulty nodes in systems of arbitrary topology containing an arbitrary number of faults. The performance of the algorithm is shown to be optimal when k=n-1 and within a factor of two of optimal, in the worst case, when k=1.<>
使用不完整诊断信息的容错多处理器系统路由
多处理器系统中的容错路由算法利用诊断信息为消息选择路径。在许多情况下,只有不完整或部分的诊断信息可用于此目的。作者提出了实现两种诊断形式的算法,即提供部分诊断信息的k-可达性诊断和k-邻域诊断。他们通过分析和在Intel iPSC/2超立方体上进行的实验,比较了这两种算法的性能和开销。他们还提出了一种路由算法,可以在包含任意数量故障的任意拓扑系统中成功地在连接的无故障节点之间路由消息。当k=n-1时,该算法的性能是最优的,在最坏的情况下,当k=1时,该算法的性能在最优的两个因子内
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信