改进三维环面网络的全局通信性能

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI:10.1109/ICPP.1994.118

Yasushi Kawakura, S. Oyanagi

{"title":"改进三维环面网络的全局通信性能","authors":"Yasushi Kawakura, S. Oyanagi","doi":"10.1109/ICPP.1994.118","DOIUrl":null,"url":null,"abstract":"The authors developed an one-to-all broadcasting algorithm which is less dependent on the increase of processors, by reducing the overhead of each communications, and by shortening the message transmission sequence. The result shows that the program which employs this algorithm can achieve a 2.8 times speedup in the case of a 32K processor system.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving the Performance of Global Communication on a 3D Torus Network\",\"authors\":\"Yasushi Kawakura, S. Oyanagi\",\"doi\":\"10.1109/ICPP.1994.118\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors developed an one-to-all broadcasting algorithm which is less dependent on the increase of processors, by reducing the overhead of each communications, and by shortening the message transmission sequence. The result shows that the program which employs this algorithm can achieve a 2.8 times speedup in the case of a 32K processor system.\",\"PeriodicalId\":162043,\"journal\":{\"name\":\"1994 International Conference on Parallel Processing Vol. 3\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.118\",\"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.118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

作者通过减少每次通信的开销和缩短消息传输序列，开发了一种对处理器增加依赖性较小的一对所有广播算法。结果表明，在32K处理器系统下，采用该算法的程序可以实现2.8倍的加速。

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

查看原文本刊更多论文

Improving the Performance of Global Communication on a 3D Torus Network

The authors developed an one-to-all broadcasting algorithm which is less dependent on the increase of processors, by reducing the overhead of each communications, and by shortening the message transmission sequence. The result shows that the program which employs this algorithm can achieve a 2.8 times speedup in the case of a 32K processor system.

求助全文

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

来源期刊

1994 International Conference on Parallel Processing Vol. 3

自引率

0.00%

发文量