|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2020 Vol.21 No.6 P.939-949
OHTMA: an optimized heuristic topology-aware mapping algorithm on the Tianhe-3 exascale supercomputer prototype
Abstract: 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.
Key words: High-performance computing, Topology mapping, Heuristic algorithm
国防科技大学计算机学院并行与分布处理国家重点实验室,中国长沙市,410073
摘要:随着应用程序规模和超级计算机体系结构复杂性的迅速增加,拓扑映射的重要性愈加凸显。高通信成本已成为超级计算机上运行的应用程序性能的主要限制因素。为避免不合适的映射策略可能带来的较差通信性能,提出一种启发式优化拓扑感知映射算法(OHTMA)。该算法旨在最小化用于测量映射结果的字节跳跃度量。OHTMA结合贪婪启发式算法和基于对交换的优化方法,减少了远程通信数量,有效增强了通信局部性。在天河三号E级原型机的实验结果表明,OHTMA算法可显著降低通信成本。
关键词组:
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.1900075
CLC number:
TP319
Download Full Text:
Downloaded:
3392
Download summary:
<Click Here>Downloaded:
1481Clicked:
5157
Cited:
0
On-line Access:
2020-06-12
Received:
2019-02-09
Revision Accepted:
2019-07-12
Crosschecked:
2020-05-09