单向超立方体上的广播

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI:10.1109/ICPADS.1994.590063

Hua-Min Huang, C.-B. Yang

{"title":"单向超立方体上的广播","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":"{\"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}","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

摘要

本文解决了偶维单向超立方体(UHC)的广播问题。在常数评估模型中，我们的一个全端口广播树的复杂度为n+1，并且是最优的。而最好的单端口广播树需要4/3(n-n模6)+3/2(n模6)步。这些算法可以推广到解决奇维情况。我们还提出了一个高度为3/2n+n模式4/2的全端口容错广播树。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Broadcasting on uni-directional hypercubes

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 1994 International Conference on Parallel and Distributed Systems

自引率

0.00%

发文量