LogGPH: A Parallel Computational Model with Hierarchical Communication Awareness

Liang Yuan, Yunquan Zhang, Yuxin Tang, L. Rao, Xiangzheng Sun
{"title":"LogGPH: A Parallel Computational Model with Hierarchical Communication Awareness","authors":"Liang Yuan, Yunquan Zhang, Yuxin Tang, L. Rao, Xiangzheng Sun","doi":"10.1109/CSE.2010.40","DOIUrl":null,"url":null,"abstract":"In large-scale cluster systems, interconnecting thousands of computing nodes increase the complexity of the network topology. Nevertheless, few existing computational models consider the impact of hierarchical communication latencies and bandwidths caused by the network complexity. In this paper we propose a new parallel computational model called LogGPH with a new parameter H incorporated into the LogGP model to describe the communication hierarchy. Through predicting and analyzing the point-to-point and collective MPI_Allgather communication on two 100-Terascale supercomputers, the Dawning 5000A and the Deep Comp 7000, with the new model, it shows that the new model is more accurate than the LogGP model. The mean of absolute error of our model on point-to-point communications is 13%, but the value is 30% without the hierarchical communication consideration.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th IEEE International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2010.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

In large-scale cluster systems, interconnecting thousands of computing nodes increase the complexity of the network topology. Nevertheless, few existing computational models consider the impact of hierarchical communication latencies and bandwidths caused by the network complexity. In this paper we propose a new parallel computational model called LogGPH with a new parameter H incorporated into the LogGP model to describe the communication hierarchy. Through predicting and analyzing the point-to-point and collective MPI_Allgather communication on two 100-Terascale supercomputers, the Dawning 5000A and the Deep Comp 7000, with the new model, it shows that the new model is more accurate than the LogGP model. The mean of absolute error of our model on point-to-point communications is 13%, but the value is 30% without the hierarchical communication consideration.
一种具有层次通信感知的并行计算模型
在大规模集群系统中,互连数千个计算节点增加了网络拓扑的复杂性。然而,现有的计算模型很少考虑到网络复杂性对分层通信延迟和带宽的影响。在本文中,我们提出了一个新的并行计算模型LogGPH,并在LogGP模型中加入一个新的参数H来描述通信层次。通过对两台100兆级超级计算机黎明5000A和深comp7000上的点对点和集体MPI_Allgather通信进行预测和分析,表明新模型比LogGP模型更准确。该模型在点对点通信条件下的绝对误差均值为13%,不考虑分层通信条件下的绝对误差均值为30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信