基于广义斐波那契树的多消息广播

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing Pub Date : 1992-12-01 DOI:10.1109/SPDP.1992.242714

Jehoshua Bruck, R. Cypher, C. T. Ho

{"title":"基于广义斐波那契树的多消息广播","authors":"Jehoshua Bruck, R. Cypher, C. T. Ho","doi":"10.1109/SPDP.1992.242714","DOIUrl":null,"url":null,"abstract":"The authors present efficient algorithms for broadcasting multiple messages. They assume n processors, one of which contains m packets that it must broadcast to each of the remaining n-1 processors. The processors communicate in rounds. In one round each processor is able to send one packet to any other processor and receive one packet from any other processor. The authors give a broadcasting algorithm which requires m+log n+3 log log n +15 rounds. In addition, they show a simple lower bound of m+(log n) -1 rounds for broadcasting in this model.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Multiple message broadcasting with generalized Fibonacci trees\",\"authors\":\"Jehoshua Bruck, R. Cypher, C. T. Ho\",\"doi\":\"10.1109/SPDP.1992.242714\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present efficient algorithms for broadcasting multiple messages. They assume n processors, one of which contains m packets that it must broadcast to each of the remaining n-1 processors. The processors communicate in rounds. In one round each processor is able to send one packet to any other processor and receive one packet from any other processor. The authors give a broadcasting algorithm which requires m+log n+3 log log n +15 rounds. In addition, they show a simple lower bound of m+(log n) -1 rounds for broadcasting in this model.<<ETX>>\",\"PeriodicalId\":265469,\"journal\":{\"name\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"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.242714\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.242714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

作者提出了广播多个消息的有效算法。他们假设有n个处理器，其中一个包含m个数据包，它必须向剩下的n-1个处理器中的每一个广播。处理器以轮询方式通信。在一轮中，每个处理器可以向任何其他处理器发送一个数据包，并从任何其他处理器接收一个数据包。给出了一个需要m+log n+3 log log n+ 15轮的广播算法。此外，他们还给出了一个简单的下界，即在该模型中广播的m+(log n) -1轮。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Multiple message broadcasting with generalized Fibonacci trees

The authors present efficient algorithms for broadcasting multiple messages. They assume n processors, one of which contains m packets that it must broadcast to each of the remaining n-1 processors. The processors communicate in rounds. In one round each processor is able to send one packet to any other processor and receive one packet from any other processor. The authors give a broadcasting algorithm which requires m+log n+3 log log n +15 rounds. In addition, they show a simple lower bound of m+(log n) -1 rounds for broadcasting in this model.<>

求助全文

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

来源期刊

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing

自引率

0.00%

发文量

期刊最新文献

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