Heuristic-based techniques for mapping irregular communication graphs to mesh topologies

Abhinav Bhatele; Laxmikant V. Kale

doi:10.1109/HPCC.2011.109

Heuristic-based techniques for mapping irregular communication graphs to mesh topologies

Abhinav Bhatele, Laxmikant V. Kale

Siebel School of Computing and Data Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011
Pages	765-771
Number of pages	7
DOIs	https://doi.org/10.1109/HPCC.2011.109
State	Published - 2011
Event	13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011 - Banff, AB, Canada Duration: Sep 2 2011 → Sep 4 2011

Publication series

Name	Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011

Other

Other	13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011
Country/Territory	Canada
City	Banff, AB
Period	9/2/11 → 9/4/11

Keywords

communication optimization
interconnect topology
irregular patterns
mapping
performance

ASJC Scopus subject areas

Artificial Intelligence
Computer Networks and Communications

Online availability

10.1109/HPCC.2011.109

Library availability

Discover UIUC Full Text

Cite this

Bhatele, A., & Kale, L. V. (2011). Heuristic-based techniques for mapping irregular communication graphs to mesh topologies. In Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011 (pp. 765-771). Article 6063073 (Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011). https://doi.org/10.1109/HPCC.2011.109

Heuristic-based techniques for mapping irregular communication graphs to mesh topologies. / Bhatele, Abhinav; Kale, Laxmikant V.
Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011. 2011. p. 765-771 6063073 (Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Bhatele, A & Kale, LV 2011, Heuristic-based techniques for mapping irregular communication graphs to mesh topologies. in Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011., 6063073, Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011, pp. 765-771, 13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011, Banff, AB, Canada, 9/2/11. https://doi.org/10.1109/HPCC.2011.109

Bhatele A, Kale LV. Heuristic-based techniques for mapping irregular communication graphs to mesh topologies. In Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011. 2011. p. 765-771. 6063073. (Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011). doi: 10.1109/HPCC.2011.109

Bhatele, Abhinav ; Kale, Laxmikant V. / Heuristic-based techniques for mapping irregular communication graphs to mesh topologies. Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011. 2011. pp. 765-771 (Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011).

@inproceedings{19e4e84df60b4168b1d8d9b9447dd3d1,

title = "Heuristic-based techniques for mapping irregular communication graphs to mesh topologies",

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.",

keywords = "communication optimization, interconnect topology, irregular patterns, mapping, performance",

author = "Abhinav Bhatele and Kale, {Laxmikant V.}",

year = "2011",

doi = "10.1109/HPCC.2011.109",

language = "English (US)",

isbn = "9780769545387",

series = "Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011",

pages = "765--771",

booktitle = "Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011",

note = "13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011 ; Conference date: 02-09-2011 Through 04-09-2011",

}

TY - GEN

T1 - Heuristic-based techniques for mapping irregular communication graphs to mesh topologies

AU - Bhatele, Abhinav

AU - Kale, Laxmikant V.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - communication optimization

KW - interconnect topology

KW - irregular patterns

KW - mapping

KW - performance

UR - http://www.scopus.com/inward/record.url?scp=81555217946&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=81555217946&partnerID=8YFLogxK

U2 - 10.1109/HPCC.2011.109

DO - 10.1109/HPCC.2011.109

M3 - Conference contribution

AN - SCOPUS:81555217946

SN - 9780769545387

T3 - Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011

SP - 765

EP - 771

BT - Proc.- 2011 IEEE International Conference on HPCC 2011 - 2011 IEEE International Workshop on FTDCS 2011 - Workshops of the 2011 Int. Conf. on UIC 2011- Workshops of the 2011 Int. Conf. ATC 2011

T2 - 13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

Y2 - 2 September 2011 through 4 September 2011

ER -

Heuristic-based techniques for mapping irregular communication graphs to mesh topologies

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this