Concurrent Bidirectional Communication On The Intel iPSC/860 And iPSC/2

S. Seidel, Ming-Homg Lee, S. Fotedar
{"title":"Concurrent Bidirectional Communication On The Intel iPSC/860 And iPSC/2","authors":"S. Seidel, Ming-Homg Lee, S. Fotedar","doi":"10.1109/DMCC.1991.633144","DOIUrl":null,"url":null,"abstract":"Each node of the Intel iPSCI2 and iPSCl860 is capable of concurrent bidirectional communication, that is, each node can concurrently send and receive a message. However, link contention created by the long message communication protocol usually interferes with this source of concurrency so that half of the total capacity of the communication network is wasted. This intelference can be overcome by synchronizing communicating pairs of nodes. The cost of algorith,ms for the simple exchange, the one-to-all broadcast, the allto-all broadcast, and the complete exchange operations can be significantly reduced, compared to the cost of their usual implementations, by exploiting this approach. Performance measurements of algorithms for these communication problems support these observations.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1991.633144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

Each node of the Intel iPSCI2 and iPSCl860 is capable of concurrent bidirectional communication, that is, each node can concurrently send and receive a message. However, link contention created by the long message communication protocol usually interferes with this source of concurrency so that half of the total capacity of the communication network is wasted. This intelference can be overcome by synchronizing communicating pairs of nodes. The cost of algorith,ms for the simple exchange, the one-to-all broadcast, the allto-all broadcast, and the complete exchange operations can be significantly reduced, compared to the cost of their usual implementations, by exploiting this approach. Performance measurements of algorithms for these communication problems support these observations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
iPSC/860和iPSC/2的并行双向通信
英特尔iPSCI2和iPSCl860的每个节点都可以并发双向通信,即每个节点都可以同时发送和接收消息。但是,由长消息通信协议创建的链路争用通常会干扰这种并发性来源,从而浪费了通信网络总容量的一半。这种干扰可以通过同步通信对节点来克服。通过利用这种方法,与通常实现的成本相比,算法的成本(用于简单交换、一对所有广播、所有对所有广播和完整交换操作的成本)可以显著降低。这些通信问题的算法性能测量支持这些观察结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Scalable Performance Environments for Parallel Systems Using Spanning-Trees for Balancing Dynamic Load on Multiprocessors Optimal Total Exchange on an SIMD Distributed-Memory Hypercube Structured Parallel Programming on Multicomputers Parallel Solutions to the Phase Problem in X-Ray Crystallography: An Update
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1