Linkage of XcalableMP and Python languages for high productivity on HPC cluster system: application to graph order/degree problem

M. Nakao, H. Murai, T. Boku, M. Sato
{"title":"Linkage of XcalableMP and Python languages for high productivity on HPC cluster system: application to graph order/degree problem","authors":"M. Nakao, H. Murai, T. Boku, M. Sato","doi":"10.1145/3176364.3176369","DOIUrl":null,"url":null,"abstract":"When developing applications on high-performance computing (HPC) cluster systems, Partitioned Global Address Space (PGAS) languages are used due to their high productivity and performance. However, in order to more efficiently develop such applications, it is also important to be able to combine a PGAS language with other languages instead of using a single PGAS language alone. We have designed an XcalableMP (XMP) PGAS language, and developed Omni Compiler as an XMP compiler. In this paper, we report on the development of linkage functions between XMP and {C, Fortran, or Python} for Omni Compiler. Furthermore, as a functional example of interworking between XMP and Python, we discuss the development of an application for the Graph Order/degree problem. Specifically, we paralleled all of the shortest paths among the vertices searches of the application using XMP. When the results of the application in XMP and the original Python were compared, we found that the performance of XMP was 21% faster than that of the original Python on a single CPU core. Moreover, when applying the application on an HPC cluster system with 1,280 CPU cores of 64 compute nodes, we could achieve a 921 times better performance than that on a single CPU core.","PeriodicalId":371083,"journal":{"name":"Proceedings of Workshops of HPC Asia","volume":"435 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Workshops of HPC Asia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3176364.3176369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

When developing applications on high-performance computing (HPC) cluster systems, Partitioned Global Address Space (PGAS) languages are used due to their high productivity and performance. However, in order to more efficiently develop such applications, it is also important to be able to combine a PGAS language with other languages instead of using a single PGAS language alone. We have designed an XcalableMP (XMP) PGAS language, and developed Omni Compiler as an XMP compiler. In this paper, we report on the development of linkage functions between XMP and {C, Fortran, or Python} for Omni Compiler. Furthermore, as a functional example of interworking between XMP and Python, we discuss the development of an application for the Graph Order/degree problem. Specifically, we paralleled all of the shortest paths among the vertices searches of the application using XMP. When the results of the application in XMP and the original Python were compared, we found that the performance of XMP was 21% faster than that of the original Python on a single CPU core. Moreover, when applying the application on an HPC cluster system with 1,280 CPU cores of 64 compute nodes, we could achieve a 921 times better performance than that on a single CPU core.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
链接XcalableMP和Python语言在HPC集群系统上的高生产力:应用于图阶/度问题
在高性能计算(HPC)集群系统上开发应用程序时,由于分区全局地址空间(PGAS)语言具有较高的生产率和性能,因此通常使用PGAS语言。然而,为了更有效地开发此类应用程序,能够将PGAS语言与其他语言结合起来而不是单独使用单一的PGAS语言也很重要。我们设计了XcalableMP (XMP) PGAS语言,并开发了Omni编译器作为XMP编译器。在本文中,我们报告了为Omni编译器开发XMP与{C, Fortran或Python}之间的链接函数。此外,作为XMP和Python之间交互的功能示例,我们讨论了图阶/度问题应用程序的开发。具体来说,我们使用XMP对应用程序的顶点搜索之间的所有最短路径进行并行处理。当将应用程序在XMP和原始Python中的结果进行比较时,我们发现XMP在单个CPU核心上的性能比原始Python快21%。此外,当应用该应用程序在具有1280个CPU核、64个计算节点的HPC集群系统上时,我们可以获得比单个CPU核提高921倍的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Scaling collectives on large clusters using Intel(R) architecture processors and fabric OpenMP-based parallel implementation of matrix-matrix multiplication on the intel knights landing Recent experiences in using MPI-3 RMA in the DASH PGAS runtime Optimizing a particle-in-cell code on Intel knights landing Towards a parallel algebraic multigrid solver using PGAS
×
引用
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