Hierarchical interconnection networks: routing performance in the presence of faults

Beomsu Kim, H. Youn, K. Kavi
{"title":"Hierarchical interconnection networks: routing performance in the presence of faults","authors":"Beomsu Kim, H. Youn, K. Kavi","doi":"10.1109/SPDP.1992.242749","DOIUrl":null,"url":null,"abstract":"The authors develop a Markov model which can effectively estimate the successful routing probability and internode distance of hierarchical interconnection networks in the presence of faults. A BH/BH (binary hypercube/binary hypercube) network is tested using the model and verified by computer simulations. Comparisons with computer simulation reveal that the proposed model is very accurate. The network performance, when all nodes generate messages, is also expected to be effectively evaluated with the model.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1992.242749","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The authors develop a Markov model which can effectively estimate the successful routing probability and internode distance of hierarchical interconnection networks in the presence of faults. A BH/BH (binary hypercube/binary hypercube) network is tested using the model and verified by computer simulations. Comparisons with computer simulation reveal that the proposed model is very accurate. The network performance, when all nodes generate messages, is also expected to be effectively evaluated with the model.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分层互连网络:存在故障时的路由性能
建立了一种马尔可夫模型,该模型可以有效地估计分层互连网络在存在故障情况下的路由成功概率和节点间距离。利用该模型对BH/BH(二进制超立方体/二进制超立方体)网络进行了测试,并通过计算机仿真进行了验证。与计算机仿真结果的比较表明,该模型具有较高的精度。当所有节点都生成消息时,也期望用该模型有效地评估网络性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On uniformization of affine dependence algorithms On embedding ternary trees into Boolean hypercubes A divide and conquer approach to shortest paths in planar layered digraphs Advanced software pipelining and the program dependence graph A fast sort using parallelism within memory
×
引用
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