OHTMA:an optimized heuristic topology-aware mapping algorithm on the Tianhe-3 exascale supercomputer prototype  

作　　者：Yi-shui LI Xin-hai CHEN Jie LIU Bo YANG Chun-ye GONG Xin-biao GAN Sheng-guo LI Han XU 

机构地区：[1]Science and Technology on Parallel and Distributed Processing Laboratory,National University of Defense Technology,Changsha 410073,China

出　　处：《Frontiers of Information Technology & Electronic Engineering》2020年第6期939-949,共11页信息与电子工程前沿（英文版）

基　　金：Project supported by the National Key Research and Development Program of China(No.2017YFB0202104)。

摘　　要：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.

关 键 词：High-performance computing Topology mapping Heuristic algorithm 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]