With the rapid increase of the size of applications and the complexity of the supercomputer architecture, topology-aware process mapping becomes increasingly important. High communication cost has become a dominant constraint of the performance of applications running on the supercomputer. To avoid a bad mapping strategy which can lead to terrible communication performance, we propose an optimized heuristic topology-aware mapping algorithm (OHTMA). The algorithm attempts to minimize the hop-byte metric that we use to measure the mapping results. OHTMA incorporates a new greedy heuristic method and pair-exchange-based optimization. It reduces the number of long-distance communications and effectively enhances the locality of the communication. Experimental results on the Tianhe-3 exascale supercomputer prototype indicate that OHTMA can significantly reduce the communication costs.

随着应用程序大小的迅速增加和超级计算机体系结构的复杂性，了解拓扑的过程映射变得越来越重要。高通信成本已成为超级计算机上运行的应用程序性能的主要限制因素。为了避免可能导致糟糕的通信性能的不良映射策略，我们提出了一种优化的启发式拓扑感知映射算法（OHTMA）。该算法尝试最小化我们用来测量映射结果的跳字节度量。OHTMA结合了新的贪婪启发式方法和基于对交换的优化。它减少了远程通信的数量，并有效地增强了通信的本地性。