Adaptive transport service selection for MPI with InfiniBand network

Masamichi Takagi, Norio Yamaguchi, Balazs Gerofi, A. Hori, Y. Ishikawa
{"title":"Adaptive transport service selection for MPI with InfiniBand network","authors":"Masamichi Takagi, Norio Yamaguchi, Balazs Gerofi, A. Hori, Y. Ishikawa","doi":"10.1145/2831129.2831132","DOIUrl":null,"url":null,"abstract":"We propose a method which adaptively selects InfiniBand transport services used for source and destination peers to improve performance while limiting memory consumption of the MPI library. There are two major choices of IB transport services available, i.e., Reliable Connection (RC) and Dynamically Connected (DC), each of which is selected for each pair of source peer and destination peer. RC is faster than DC for all communication patterns except for the case where there are many active RCs. It also consumes a lot of memory when there are many processes. DC, on the other hand, consumes less memory than RC but its performance drops when sending messages to different destinations or when many DCs sends a message to the same destination DC. Therefore, the library should find the best mapping of RCs and DCs to pairs of source peer and destination peer according to the communication pattern of the application. Our method finds a good mapping by comparing potential latency benefits for candidate mappings. It achieves 13%--19% latency reduction when compared to the methods using only DCs in micro-benchmarks representing communication patterns problematic to RC or DC with 64 processes.","PeriodicalId":417011,"journal":{"name":"Workshop on Exascale MPI","volume":"30 15","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Exascale MPI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2831129.2831132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We propose a method which adaptively selects InfiniBand transport services used for source and destination peers to improve performance while limiting memory consumption of the MPI library. There are two major choices of IB transport services available, i.e., Reliable Connection (RC) and Dynamically Connected (DC), each of which is selected for each pair of source peer and destination peer. RC is faster than DC for all communication patterns except for the case where there are many active RCs. It also consumes a lot of memory when there are many processes. DC, on the other hand, consumes less memory than RC but its performance drops when sending messages to different destinations or when many DCs sends a message to the same destination DC. Therefore, the library should find the best mapping of RCs and DCs to pairs of source peer and destination peer according to the communication pattern of the application. Our method finds a good mapping by comparing potential latency benefits for candidate mappings. It achieves 13%--19% latency reduction when compared to the methods using only DCs in micro-benchmarks representing communication patterns problematic to RC or DC with 64 processes.
基于ib网络的MPI自适应传输服务选择
我们提出了一种自适应地选择源端和目标端使用的InfiniBand传输服务的方法,以提高性能,同时限制MPI库的内存消耗。可用的IB传输服务有两种主要选择,即可靠连接(RC)和动态连接(DC),每对源对等体和目标对等体都选择这两种服务。除了存在许多活动RC的情况外,对于所有通信模式,RC都比DC快。当有很多进程时,它也会消耗大量内存。另一方面,DC比RC消耗更少的内存,但是当向不同的目标发送消息或多个DC向相同的目标DC发送消息时,其性能会下降。因此,库应该根据应用程序的通信模式找到rc和dc到源对等体和目标对等体对的最佳映射。我们的方法通过比较候选映射的潜在延迟优势来找到一个好的映射。与在微基准测试中仅使用DC的方法相比,它可以减少13%- 19%的延迟,这些方法表示对RC或具有64个进程的DC有问题的通信模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信