Performance comparison of Eulerian kinetic Vlasov code between flat-MPI parallelism and hybrid parallelism on Fujitsu FX100 supercomputer

T. Umeda, K. Fukazawa
{"title":"Performance comparison of Eulerian kinetic Vlasov code between flat-MPI parallelism and hybrid parallelism on Fujitsu FX100 supercomputer","authors":"T. Umeda, K. Fukazawa","doi":"10.1145/2966884.2966891","DOIUrl":null,"url":null,"abstract":"The present study deals with the Vlasov simulation code, which solves the first-principle kinetic equations called the Vlasov equation for space plasma. In the present study, a five-dimensional Vlasov code with two spatial dimension and three velocity dimensions is parallelized with two methods, the flat-MPI and the MPI-OpenMP hybrid parallelism. The two types of the parallel Vlasov code are benchmarked on massively-parallel supercomputer Fujitsu FX100, which has been developed with the second-generation post architecture of the K computer in Japan. In the present performance comparison, we vary the number of threads per nodes from 1 (the flat-MPI parallelism) to 32. The result shows that the OpenMP-MPI hybrid parallelism outperforms the flat-MPI for any number of compute nodes. There is an optimum number of threads per nodes depending on the number of compute nodes. It is shown that the optimum number of threads per node becomes larger on a larger number of compute nodes. This is because the communication time of an MPI collective communication subroutine, which is used for convergence check of iterative methods, can be reduced by decreasing the total number of processes with the OpenMP-MPI hybrid parallelism.","PeriodicalId":264069,"journal":{"name":"Proceedings of the 23rd European MPI Users' Group Meeting","volume":"35 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 23rd European MPI Users' Group Meeting","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2966884.2966891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The present study deals with the Vlasov simulation code, which solves the first-principle kinetic equations called the Vlasov equation for space plasma. In the present study, a five-dimensional Vlasov code with two spatial dimension and three velocity dimensions is parallelized with two methods, the flat-MPI and the MPI-OpenMP hybrid parallelism. The two types of the parallel Vlasov code are benchmarked on massively-parallel supercomputer Fujitsu FX100, which has been developed with the second-generation post architecture of the K computer in Japan. In the present performance comparison, we vary the number of threads per nodes from 1 (the flat-MPI parallelism) to 32. The result shows that the OpenMP-MPI hybrid parallelism outperforms the flat-MPI for any number of compute nodes. There is an optimum number of threads per nodes depending on the number of compute nodes. It is shown that the optimum number of threads per node becomes larger on a larger number of compute nodes. This is because the communication time of an MPI collective communication subroutine, which is used for convergence check of iterative methods, can be reduced by decreasing the total number of processes with the OpenMP-MPI hybrid parallelism.
Fujitsu FX100超级计算机上平动并行和混合并行欧拉动力学Vlasov码性能比较
本研究涉及弗拉索夫模拟程序,该程序求解空间等离子体的第一原理动力学方程称为弗拉索夫方程。本文采用平面- mpi和MPI-OpenMP混合并行两种方法对具有两个空间维度和三个速度维度的五维弗拉索夫码进行并行化。这两种并行的Vlasov代码在大规模并行超级计算机富士通FX100上进行了基准测试,该超级计算机是根据日本K计算机的第二代后架构开发的。在当前的性能比较中,我们将每个节点的线程数从1(平mpi并行度)更改为32。结果表明,对于任意数量的计算节点,OpenMP-MPI混合并行性优于扁平mpi。每个节点的最佳线程数取决于计算节点的数量。结果表明,计算节点越多,每个节点的最佳线程数越大。这是因为用于迭代方法收敛性检查的MPI集体通信子程序的通信时间可以通过使用OpenMP-MPI混合并行性减少进程总数来减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信