Bandwidth-efficient collective communication for clustered wide area systems
Bandwidth-efficient collective communication for clustered wide area systems
复制标题
集群广域系统的带宽高效集体通信
DOI：
10.1109/ipdps.2000.846026
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
S. Gorlatch
中科院分区：
文献类型：
--
作者：
T. Kielmann;H. Bal;S. Gorlatch
元计算基础设施通过广域网耦合多个集群（或MPP）。在这样的平台上编程并行应用程序的一个主要问题是它们的分层网络结构：WAN的延迟和带宽通常比本地网络差几个数量级。我们的目标是优化MPI的集体行动，这样的平台。在本文中，我们专注于优化利用（稀缺）广域带宽。我们使用两种技术：选择合适的通信图形状，并将消息拆分为多个段，通过不同的WAN链路并行发送。为了确定最佳的图形形状和段的大小，我们引入了一个性能模型，称为参数化LogP（P-LogP），LogP模型的分层扩展，包括任意长度的消息。使用P-LogP，可以在运行时确定最佳段大小和最佳广播树形状。(For为了简明起见，我们将讨论限制在广播操作上）。实验性能评估表明，新的广播有显着提高性能（大消息），有一个密切的匹配之间的理论模型和测量完成时间。
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchical network structure: latency and bandwidth of WANs often are orders of magnitude worse than those of local networks. Our goal is to optimize MPI's collective operations for such platforms. In this paper we focus on optimized utilization of the (scarce) wide-area bandwidth. We use two techniques: selecting suitable communication graph shapes, and splitting messages into multiple segments that are sent in parallel over different WAN links. To determine the best graph shape and segment size, we introduce a performance model called parameterized LogP (P-LogP), a hierarchical extension of the LogP model that covers messages of arbitrary length. With P-LogP, the optimal segment size and the best broadcast tree shape can be determined at runtime. (For conciseness, we restrict our discussion to the broadcast operation). An experimental performance evaluation shows that the new broadcast has significantly improved performance (for large messages) and that there is a close match between the theoretical model and the measured completion times.
DOI：
10.12694/scpe.v3i3.192
发表时间：
2000
期刊：
Parallel Distributed Comput. Pract.
影响因子：
--
作者：
A. Marowka
通讯作者：
A. Marowka