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

DOI10.1016/J.JPDC.2012.01.018zbMATH Open1248.68071OpenAlexW2014455962MaRDI QIDQ456008FDOQ456008

Authors: 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

Recommendations

• Bandwidth efficient all-to-all broadcast on switched clusters
• scientific article; zbMATH DE number 1948475
• Efficient collective communication in distributed heterogeneous systems.
• Network performance-aware collective communication for clustered wide-area systems
• The fat-stack and universal routing in interconnection networks

zbMATH Keywords

network topologiescollective communicationrouting algorithms and techniques

Mathematics Subject Classification ID

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

Cites Work

• Performance analysis of wormhole routed \(k\)-ary \(n\)-trees

Cited In (1)

• Cayley graphs of groupoids and generalized fat-trees

Uses Software

• OMNet++
• OpenMPI

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456008)