Visualization Tool for Development of Communication Algorithms and a Case Study Using the K Computer-猫眼课题宝

DOI：

发表时间：

2015-03

期刊：

影响因子：

通讯作者：

中科院分区：

其他

文献类型：

作者：

S. Yazaki;Ryohei Suzuki;F. Shoji;K. Miura;H. Ishihata

在本文中，我们介绍了我们的可视化工具，通信日志查看器（CLV），协助集体通信算法的发展。我们还提出了可视化结果作为案例研究。CLV在链接的多个视图中可视化有关节点事件和网络统计信息。CLV还具有分析从同一框架中的网络模拟器和实际机器获得的结果的功能，这在开发人员在模拟器和实际系统上重复测试其算法时非常有用。对于一个案例研究，我们在具有82，944个节点的K计算机的整个系统上可视化地评估了两个全对全算法。因此，我们证实了为K计算机实现的优化的all-to-all算法比在Open MPI中实现的all-to-all算法性能更好。我们还证实了K计算机的消息传递接口（MPI）函数中使用的屏障操作保持了较高的链路利用率。然而，在障碍的数量和链路利用率之间也存在权衡。关键词-可视化; Mesh/Torus网络; All-to-all

In this paper, we introduce our visualization tool, the Communication Log Viewer (CLV), that assists the development of collective communication algorithms. We also present visualization results as a case study. CLV visualizes information regarding node events and network statistics in linked multiple views. CLV also has a function for analyzing the results obtained from network simulators and actual machines in the same framework, which is useful when developers repeatedly test their algorithms on a simulator and an actual system. For a case study, we visually evaluated two all-to-all algorithms on the full system of the K computer that has 82,944 nodes. As a result, we confirmed that an optimized all-to-all algorithm implemented for the K computer performed better than an all-to-all implemented in Open MPI. We also confirmed that the barrier operation used in the K computer’s Message Passing Interface (MPI) functions keep link utilization high. However, there is also a trade-off between the number of barriers and link utilization. Keywords–Visualization; Mesh/Torus network; All-to-all

Visualization Tool for Development of Communication Algorithms and a Case Study Using the K Computer

文献摘要

相似文献