Automating Topology Aware Mapping for Supercomputers

Performance improvements through topology aware placement for applications such as NAMD and OpenAtom are used to motivate this work. Building on these ideas, the dissertation proposes algorithms and techniques for automatic mapping of parallel applications to relieve the application developers of this burden. The effect of contention on message latencies is studied in depth to guide the design of mapping algorithms. The hop-bytes metric is proposed for the evaluation of mapping algorithms as a better metric than the previously used maximum dilation metric. The main focus of this dissertation is on developing topology aware mapping algorithms for parallel applications with regular and irregular communication patterns. The automatic mapping framework is a suite of such algorithms with capabilities to choose the best mapping for a problem with a given communication graph. The dissertation also briefly discusses completely distributed mapping techniques which will be imperative for machines of the future.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Bhatele, Abhinav

Contributors dc:contributor

• Kale, Laxmikant V.

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI3425400

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/87863