Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies

Workshop on Extreme Scale Computing APplication Enablement - Modeling and Tools at HPCC (ESCAPE) 2011

Pulication Type: Paper

Download: pdf ps

Abstract

Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by messages on the network and hence reduce contention, which can lead to improved performance. This paper discusses heuristic techniques for mapping applications with irregular communication graphs to mesh and torus topologies. Parallel codes with irregular communication constitute an important class of applications. Unstructured grid applications are a classic example of codes with irregular communication patterns. Since the mapping problem is NP-hard, this paper presents fast heuristic-based algorithms. These heuristics are part of a larger framework for automatic mapping of parallel applications. We evaluate the heuristics in this paper in terms of the reduction in average hops per byte. The heuristics discussed here are applicable to most parallel applications since irregular graphs constitute the most general category of communication patterns. Some heuristics can also be easily extended to other network topologies.

Research Areas

Topology Aware Mapping

Text Ref

Abhinav Bhatele and Laxmikant V. Kale, "Heuristic-based techniques for mapping irregular communication graphs to mesh topologies", Proceedings of Workshop on Extreme Scale Computing APplication Enablement - Modeling and Tools (to appear), 2011

BibTex

@inproceedings{MapIrrGraphs2011,
  author = "Abhinav Bhatele and Laxmikant V. Kale",
  title = {Heuristic-based techniques for mapping irregular communication graphs to mesh topologies},
  month	= "September",
  year = "2011",
  booktitle = "Proceedings of Workshop on Extreme Scale Computing APplication Enablement - Modeling and Tools"
}