Fat-tree routing and node ordering providing contention free traffic for MPI global collectives

DOI10.1016/J.JPDC.2012.01.018zbMath1248.68071OpenAlexW2014455962MaRDI QIDQ456008

Eitan Zahavi

Publication date: 23 October 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.01.018

zbMATH Keywords

collective communicationnetwork topologiesrouting algorithms and techniques

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (1)

Cayley graphs of groupoids and generalized fat-trees

Uses Software

• OMNet++
• OpenMPI

Cites Work

• PERFORMANCE ANALYSIS OF WORMHOLE ROUTED K-Ary N-TREES

This page was built for publication: Fat-tree routing and node ordering providing contention free traffic for MPI global collectives