Overhead of a decentralized gossip algorithm on the performance of HPC applications

ROSS@ICS Pub Date : 2014-06-10 DOI:10.1145/2612262.2612271
Ely Levy, A. Barak, A. Shiloh, Matthias Lieber, C. Weinhold, Hermann Härtig
{"title":"Overhead of a decentralized gossip algorithm on the performance of HPC applications","authors":"Ely Levy, A. Barak, A. Shiloh, Matthias Lieber, C. Weinhold, Hermann Härtig","doi":"10.1145/2612262.2612271","DOIUrl":null,"url":null,"abstract":"Gossip algorithms can provide online information about the availability and the state of the resources in supercomputers. These algorithms require minimal computing and storage capabilities at each node and when properly tuned, they are not expected to overload the nodes or the network that connects these nodes. These properties make gossip interesting for future exascale systems. This paper examines the overhead of a decentralized gossip algorithm on the performance of parallel MPI applications running on up to 8192 nodes of an IBM BlueGene/Q supercomputer. The applications that were used in the experiments include PTRANS and MPI-FFT from the HPCC benchmark suite as well as the coupled weather and cloud simulation model COSMO-SPECS+FD4. In most cases, no gossip overhead was observed when the gossip messages were sent at intervals of 256ms or more. As expected, the overhead that is observed at higher rates is sensitive to the communication pattern of the application and the amount of gossip information being circulated.","PeriodicalId":216902,"journal":{"name":"ROSS@ICS","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ROSS@ICS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2612262.2612271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Gossip algorithms can provide online information about the availability and the state of the resources in supercomputers. These algorithms require minimal computing and storage capabilities at each node and when properly tuned, they are not expected to overload the nodes or the network that connects these nodes. These properties make gossip interesting for future exascale systems. This paper examines the overhead of a decentralized gossip algorithm on the performance of parallel MPI applications running on up to 8192 nodes of an IBM BlueGene/Q supercomputer. The applications that were used in the experiments include PTRANS and MPI-FFT from the HPCC benchmark suite as well as the coupled weather and cloud simulation model COSMO-SPECS+FD4. In most cases, no gossip overhead was observed when the gossip messages were sent at intervals of 256ms or more. As expected, the overhead that is observed at higher rates is sensitive to the communication pattern of the application and the amount of gossip information being circulated.
分散式八卦算法对高性能计算应用性能的影响
八卦算法可以在线提供超级计算机中资源的可用性和状态信息。这些算法对每个节点的计算和存储能力要求最低,并且在适当调优时,它们不会使节点或连接这些节点的网络过载。这些特性让未来的百亿亿级系统变得有趣起来。本文研究了在IBM BlueGene/Q超级计算机多达8192个节点上运行并行MPI应用程序时,分散八卦算法对性能的开销。实验中使用的应用程序包括HPCC基准套件中的PTRANS和MPI-FFT,以及耦合天气和云模拟模型cosmos - specs +FD4。在大多数情况下,当以256ms或更长时间间隔发送八卦消息时,不会观察到八卦开销。正如预期的那样,在较高速率下观察到的开销对应用程序的通信模式和正在传播的八卦信息的数量很敏感。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信