Fat-tree routing and node ordering providing contention free traffic for MPI global collectives
Author:
- Eitan ZahaviEZEitan Zahavi
- 1 November 2012
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 72 (11) , 1423-1432
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Optimized InfiniBandTMfat‐tree routing for shift all‐to‐all communication patternsConcurrency and Computation: Practice and Experience, 2009
- Multistage switches are not crossbars: Effects of static routing in high-performance networks2008
- Deterministic versus Adaptive Routing in Fat-Trees2007
- Optimization of Collective Communication Operations in MPICHThe International Journal of High Performance Computing Applications, 2005
- Scaling all-to-all multicast on fat-tree networks2004
- k-ary n-trees: high performance networks for massively parallel architectures2002
- On generalized fat trees2002
- A message passing standard for MPP and workstationsCommunications of the ACM, 1996
- Fat-trees: Universal networks for hardware-efficient supercomputingIEEE Transactions on Computers, 1985