针对胖树互连的sdn增强型MPI广播的设计与实现

H. Morimoto, Khureltulga Dashdavaa, Keichi Takahashi, Y. Kido, S. Date, S. Shimojo
{"title":"针对胖树互连的sdn增强型MPI广播的设计与实现","authors":"H. Morimoto, Khureltulga Dashdavaa, Keichi Takahashi, Y. Kido, S. Date, S. Shimojo","doi":"10.1109/HPCS.2017.46","DOIUrl":null,"url":null,"abstract":"To meet the rising demands on high-performance computing, the number of computing nodes composing a high- performance computing system has been continuously growing. Simultaneously, the complexity of networks linking such computing nodes, or the interconnect, has also been increasing. Taking the scale-out of computing nodes in future high-performance computing systems into consideration, it is unrealistic to build more nodes with the strategy of building a network capacity sufficient enough to accommodate maximum traffic. We have worked on SDN-enhanced MPI based on the challenging idea that network traffic should be controlled based on the time-variant requirements of applications running on the high-performance computing systems. In particular, this paper aims to accelerate MPI_Bcast execution through the use of Software Defined Net-working (SDN), targeting a high-performance computing system with a Fat-tree interconnect. The MPI_Bcast proposed in this paper has the functionality of making a delivery tree of data based on traffic information obtained from SDN switches that compose the deployed interconnect. Our evaluation observed our proposed MPI_Bcast was executed up to 8.6 times faster than our previous MPI_Bcast implementation when a 700 Mbps pseudo traffic was flowed on the Fat-tree interconnect.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Design and Implementation of SDN-enhanced MPI Broadcast Targeting a Fat-Tree Interconnect\",\"authors\":\"H. Morimoto, Khureltulga Dashdavaa, Keichi Takahashi, Y. Kido, S. Date, S. Shimojo\",\"doi\":\"10.1109/HPCS.2017.46\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To meet the rising demands on high-performance computing, the number of computing nodes composing a high- performance computing system has been continuously growing. Simultaneously, the complexity of networks linking such computing nodes, or the interconnect, has also been increasing. Taking the scale-out of computing nodes in future high-performance computing systems into consideration, it is unrealistic to build more nodes with the strategy of building a network capacity sufficient enough to accommodate maximum traffic. We have worked on SDN-enhanced MPI based on the challenging idea that network traffic should be controlled based on the time-variant requirements of applications running on the high-performance computing systems. In particular, this paper aims to accelerate MPI_Bcast execution through the use of Software Defined Net-working (SDN), targeting a high-performance computing system with a Fat-tree interconnect. The MPI_Bcast proposed in this paper has the functionality of making a delivery tree of data based on traffic information obtained from SDN switches that compose the deployed interconnect. Our evaluation observed our proposed MPI_Bcast was executed up to 8.6 times faster than our previous MPI_Bcast implementation when a 700 Mbps pseudo traffic was flowed on the Fat-tree interconnect.\",\"PeriodicalId\":115758,\"journal\":{\"name\":\"2017 International Conference on High Performance Computing & Simulation (HPCS)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on High Performance Computing & Simulation (HPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCS.2017.46\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on High Performance Computing & Simulation (HPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCS.2017.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

为了满足日益增长的高性能计算需求,组成高性能计算系统的计算节点数量不断增加。同时,连接这些计算节点或互连的网络的复杂性也在增加。考虑到未来高性能计算系统中计算节点的向外扩展,采用构建足够网络容量以容纳最大流量的策略来构建更多节点是不现实的。我们研究了sdn增强的MPI,基于一个具有挑战性的想法,即网络流量应该根据运行在高性能计算系统上的应用程序的时变需求进行控制。特别是,本文旨在通过使用软件定义网络(SDN)来加速MPI_Bcast的执行,目标是具有Fat-tree互连的高性能计算系统。本文提出的MPI_Bcast具有基于从构成已部署互连的SDN交换机获得的流量信息制作数据交付树的功能。我们的评估发现,当在Fat-tree互连上传输700 Mbps的伪流量时,我们提出的MPI_Bcast执行速度比以前的MPI_Bcast实现快8.6倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design and Implementation of SDN-enhanced MPI Broadcast Targeting a Fat-Tree Interconnect
To meet the rising demands on high-performance computing, the number of computing nodes composing a high- performance computing system has been continuously growing. Simultaneously, the complexity of networks linking such computing nodes, or the interconnect, has also been increasing. Taking the scale-out of computing nodes in future high-performance computing systems into consideration, it is unrealistic to build more nodes with the strategy of building a network capacity sufficient enough to accommodate maximum traffic. We have worked on SDN-enhanced MPI based on the challenging idea that network traffic should be controlled based on the time-variant requirements of applications running on the high-performance computing systems. In particular, this paper aims to accelerate MPI_Bcast execution through the use of Software Defined Net-working (SDN), targeting a high-performance computing system with a Fat-tree interconnect. The MPI_Bcast proposed in this paper has the functionality of making a delivery tree of data based on traffic information obtained from SDN switches that compose the deployed interconnect. Our evaluation observed our proposed MPI_Bcast was executed up to 8.6 times faster than our previous MPI_Bcast implementation when a 700 Mbps pseudo traffic was flowed on the Fat-tree interconnect.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信