全端口虫洞路由超立方体的最优广播

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI:10.1109/ICPP.1994.141

Ching-Tien Ho Ching-Tien Ho, Ming-Yang Kao Ming-Yang Kao

{"title":"全端口虫洞路由超立方体的最优广播","authors":"Ching-Tien Ho Ching-Tien Ho, Ming-Yang Kao Ming-Yang Kao","doi":"10.1109/ICPP.1994.141","DOIUrl":null,"url":null,"abstract":"We give an optimal algorithm that broadcasts on an n-dimensional hypercube in Theta(n/ log_{2}(n+ 1)) routing steps with wormhole, e-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires [n/2] routing steps. We also give routing algorithms that achieve tight time bounds for n leqslant 7.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Optimal Broadcast in All-Port Wormhole-Routed Hypercubes\",\"authors\":\"Ching-Tien Ho Ching-Tien Ho, Ming-Yang Kao Ming-Yang Kao\",\"doi\":\"10.1109/ICPP.1994.141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an optimal algorithm that broadcasts on an n-dimensional hypercube in Theta(n/ log_{2}(n+ 1)) routing steps with wormhole, e-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires [n/2] routing steps. We also give routing algorithms that achieve tight time bounds for n leqslant 7.\",\"PeriodicalId\":162043,\"journal\":{\"name\":\"1994 International Conference on Parallel Processing Vol. 3\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 International Conference on Parallel Processing Vol. 3\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.1994.141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 International Conference on Parallel Processing Vol. 3","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.1994.141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

我们给出了一种基于虫洞、e-cube路由和全端口通信的Theta(n/ log_{2}(n+ 1))路由步骤在n维超立方体上广播的最优算法。以前，McKinley和Trefftz的最佳算法需要[n/2]个路由步骤。我们也给出了路由算法，以达到严格的时间界限为n - legslant7。

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

查看原文本刊更多论文

Optimal Broadcast in All-Port Wormhole-Routed Hypercubes

We give an optimal algorithm that broadcasts on an n-dimensional hypercube in Theta(n/ log_{2}(n+ 1)) routing steps with wormhole, e-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires [n/2] routing steps. We also give routing algorithms that achieve tight time bounds for n leqslant 7.

求助全文

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

来源期刊

1994 International Conference on Parallel Processing Vol. 3

自引率

0.00%

发文量