Broadcasting on uni-directional hypercubes

Hua-Min Huang, C.-B. Yang
{"title":"Broadcasting on uni-directional hypercubes","authors":"Hua-Min Huang, C.-B. Yang","doi":"10.1109/ICPADS.1994.590063","DOIUrl":null,"url":null,"abstract":"In this paper, we solve the broadcasting problem for the even dimensional uni-directional hypercube (UHC). In the constant evaluation model, the complexity of one of our all-port broadcasting trees, is n+1, and it is optimal. Whereas the best one of our one-port broadcasting trees needs 4/3(n-n mode 6)+3/2(n mod 6) steps. These algorithms can be extended to solve the odd dimensional case. We also propose an all-port fault-tolerant broadcasting tree whose height is 3/2n+n mode 4/2.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1994.590063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we solve the broadcasting problem for the even dimensional uni-directional hypercube (UHC). In the constant evaluation model, the complexity of one of our all-port broadcasting trees, is n+1, and it is optimal. Whereas the best one of our one-port broadcasting trees needs 4/3(n-n mode 6)+3/2(n mod 6) steps. These algorithms can be extended to solve the odd dimensional case. We also propose an all-port fault-tolerant broadcasting tree whose height is 3/2n+n mode 4/2.
单向超立方体上的广播
本文解决了偶维单向超立方体(UHC)的广播问题。在常数评估模型中,我们的一个全端口广播树的复杂度为n+1,并且是最优的。而最好的单端口广播树需要4/3(n-n模6)+3/2(n模6)步。这些算法可以推广到解决奇维情况。我们还提出了一个高度为3/2n+n模式4/2的全端口容错广播树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信