线性阵列和环的最优总交换

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI:10.1109/ISPAN.1994.367190

V. Dimakopoulos, N. Dimopoulos

{"title":"线性阵列和环的最优总交换","authors":"V. Dimakopoulos, N. Dimopoulos","doi":"10.1109/ISPAN.1994.367190","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of total exchange (or multi-scattering) in the context of linear arrays and rings. Such a communication mode occurs when each node has a distinct message to send to every other node in the network. The problem has been studied extensively, although no optimal algorithm has been proposed for the two networks of interest. We present simple algorithms for the two topologies and prove their optimality.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimal total exchange in linear arrays and rings\",\"authors\":\"V. Dimakopoulos, N. Dimopoulos\",\"doi\":\"10.1109/ISPAN.1994.367190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the problem of total exchange (or multi-scattering) in the context of linear arrays and rings. Such a communication mode occurs when each node has a distinct message to send to every other node in the network. The problem has been studied extensively, although no optimal algorithm has been proposed for the two networks of interest. We present simple algorithms for the two topologies and prove their optimality.<<ETX>>\",\"PeriodicalId\":142405,\"journal\":{\"name\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.1994.367190\",\"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 the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.1994.367190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文研究了线性阵列和环的全交换(或多重散射)问题。当每个节点都有一个不同的消息要发送到网络中的每个其他节点时，就会出现这种通信模式。这个问题已经得到了广泛的研究，尽管还没有针对这两个感兴趣的网络提出最优算法。我们给出了两种拓扑的简单算法，并证明了它们的最优性。

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

查看原文本刊更多论文

Optimal total exchange in linear arrays and rings

In this paper we consider the problem of total exchange (or multi-scattering) in the context of linear arrays and rings. Such a communication mode occurs when each node has a distinct message to send to every other node in the network. The problem has been studied extensively, although no optimal algorithm has been proposed for the two networks of interest. We present simple algorithms for the two topologies and prove their optimality.<>

求助全文

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

来源期刊

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

自引率

0.00%

发文量