Effective Routing on Fat-Tree Topologies

[1]  Amith R. Mamidala,et al.  Hot-Spot Avoidance With Multi-Pathing Over InfiniBand: An MPI Perspective , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[2]  Lorenzo Fernández,et al.  Congestion Control for High Performance Virtual Cut-through Networks , 2003, Applied Informatics.

[3]  Aurelio Bermúdez,et al.  Fast routing computation on InfiniBand networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[4]  Pedro López,et al.  Improving routing performance in Myrinet networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[5]  William J. Dally,et al.  Adaptive Routing in High-Radix Clos Network , 2006, ACM/IEEE SC 2006 Conference (SC'06).

[6]  Antonio Robles,et al.  Effective methodology for deadlock-free minimal routing in InfiniBand networks , 2002, Proceedings International Conference on Parallel Processing.

[7]  Fabrizio Petrini,et al.  k-ary n-trees: high performance networks for massively parallel architectures , 1997, Proceedings 11th International Parallel Processing Symposium.

[8]  Torsten Hoefler,et al.  Adaptive Routing Strategies for Modern High Performance Networks , 2008, 2008 16th IEEE Symposium on High Performance Interconnects.

[9]  Edith Cohen,et al.  Coping with network failures: routing strategies for optimal demand oblivious restoration , 2004, SIGMETRICS '04/Performance '04.

[10]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[11]  Ware Myers.  Supercomputing 91 , 1992 .

[12]  Charles E. Leiserson,et al.  Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..

[13]  David H. Bailey,et al.  The NAS parallel benchmarks summary and preliminary results , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[14]  David H. Bailey,et al.  The Nas Parallel Benchmarks , 1991, Int. J. High Perform. Comput. Appl..

[15]  Mohan Kumar,et al.  On generalized fat trees , 1995, Proceedings of 9th International Parallel Processing Symposium.

[16]  Xin Yuan,et al.  Improving Performance of Deterministic Single-Path Routing on 2-Level Generalized Fat-Trees , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[17]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[18]  Rami G. Melhem,et al.  Oblivious Routing in Fat-Tree Based System Area Networks With Uncertain Traffic Demands , 2007, IEEE/ACM Transactions on Networking.

[19]  Mateo Valero,et al.  Oblivious routing schemes in extended generalized Fat Tree networks , 2009, 2009 IEEE International Conference on Cluster Computing and Workshops.

[20]  Fabio Checconi,et al.  Characterization of the Communication Patterns of Scientific Applications on Blue Gene/P , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[21]  Jehoshua Bruck,et al.  Efficient algorithms for all-to-all communications in multi-port message-passing systems , 1994, SPAA '94.

[22]  Pedro López,et al.  Deadlock-free routing in InfiniBand/sup TM/ through destination renaming , 2001, International Conference on Parallel Processing, 2001..

[23]  Xin Yuan,et al.  Limited Multi-path Routing on Extended Generalized Fat-trees , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

[24]  Pedro López,et al.  Deterministic versus Adaptive Routing in Fat-Trees , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.