Regularizing Sparse and Imbalanced Communications for Voxel-based Brain Simulations on Supercomputers

Yuhao Liu, Xin Du, Zhihui Lu, Qiang Duan, Jianfeng Feng, Ming-zhi Wang, Jie Wu
{"title":"Regularizing Sparse and Imbalanced Communications for Voxel-based Brain Simulations on Supercomputers","authors":"Yuhao Liu, Xin Du, Zhihui Lu, Qiang Duan, Jianfeng Feng, Ming-zhi Wang, Jie Wu","doi":"10.1145/3545008.3545019","DOIUrl":null,"url":null,"abstract":"Inter-process communications form a performance bottleneck for large-scale brain simulations. The sparse and imbalanced communication patterns of human brain make it particularly challenging to design a communication system for supporting large-scale brain simulations. In this paper, we tackle the communication challenges posed by large-scale brain simulations with sparse and imbalanced communication patterns. We design a virtual communication topology with a merge and forward algorithm that exploits the sparsity to regularize inter-process communications. To balance the communication loads of different processes, we formulate voxel partition in brain simulations as a k-way graph partition problem and propose a constrained deterministic greedy algorithm to solve the problem effectively. We conducted extensive simulation experiments for evaluating the performance of the proposed communication scheme and found that the proposed method may significantly reduce communication overheads and shorten simulation time for large-scale brain models.","PeriodicalId":360504,"journal":{"name":"Proceedings of the 51st International Conference on Parallel Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 51st International Conference on Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3545008.3545019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Inter-process communications form a performance bottleneck for large-scale brain simulations. The sparse and imbalanced communication patterns of human brain make it particularly challenging to design a communication system for supporting large-scale brain simulations. In this paper, we tackle the communication challenges posed by large-scale brain simulations with sparse and imbalanced communication patterns. We design a virtual communication topology with a merge and forward algorithm that exploits the sparsity to regularize inter-process communications. To balance the communication loads of different processes, we formulate voxel partition in brain simulations as a k-way graph partition problem and propose a constrained deterministic greedy algorithm to solve the problem effectively. We conducted extensive simulation experiments for evaluating the performance of the proposed communication scheme and found that the proposed method may significantly reduce communication overheads and shorten simulation time for large-scale brain models.
在超级计算机上基于体素的脑模拟中的正则化稀疏和不平衡通信
进程间通信形成了大规模大脑模拟的性能瓶颈。人类大脑的稀疏和不平衡的通信模式使得设计一个支持大规模大脑模拟的通信系统特别具有挑战性。在本文中,我们解决了稀疏和不平衡通信模式的大规模大脑模拟所带来的通信挑战。我们设计了一个虚拟通信拓扑结构,该拓扑结构采用合并转发算法,利用稀疏性规范进程间通信。为了平衡不同进程间的通信负荷,我们将脑模拟中的体素划分表述为一个k-way图划分问题,并提出了一种约束确定性贪婪算法来有效地解决该问题。我们进行了大量的仿真实验来评估所提出的通信方案的性能,发现所提出的方法可以显着降低通信开销并缩短大规模脑模型的仿真时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信