期刊
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
卷 18, 期 12, 页码 2467-2476出版社
IEEE COMPUTER SOC
DOI: 10.1109/TVCG.2012.286
关键词
Performance analysis; network traffic visualization; projected graph layouts
资金
- NSF [IIS-1045032, OCI-0904631, OCI-0906379, CCF-0702817]
- KAUST [KUS-C1-016-04]
- U.S. Department of Energy by the University of Utah [DE-SC0001922, DE-AC52-07NA27344, DE-FC02-06ER25781]
- Lawrence Livermore National Laboratory [DE-AC52-07NA27344 (LLNL-CONF-543359)]
- Direct For Computer & Info Scie & Enginr
- Office of Advanced Cyberinfrastructure (OAC) [0904631] Funding Source: National Science Foundation
The performance of massively parallel applications is often heavily impacted by the cost of communication among compute nodes. However, determining how to best use the network is a formidable task, made challenging by the ever increasing size and complexity of modern supercomputers. This paper applies visualization techniques to aid parallel application developers in understanding the network activity by enabling a detailed exploration of the flow of packets through the hardware interconnect. In order to visualize this large and complex data, we employ two linked views of the hardware network. The first is a 2D view, that represents the network structure as one of several simplified planar projections. This view is designed to allow a user to easily identify trends and patterns in the network traffic. The second is a 3D view that augments the 2D view by preserving the physical network topology and providing a context that is familiar to the application developers. Using the massively parallel multi-physics code pF3D as a case study, we demonstrate that our tool provides valuable insight that we use to explain and optimize pF3D's performance on an IBM Blue Gene/P system.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据