Multistage switches are not crossbars: Effects of static routing in high-performance networks

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn Proceedings of the 2008 IEEE International Conference on Cluster Computing, ICCC 2008, Issue , 2008, Pages 116-125

  Hoefler, Torsten ^a   Schneider, Timo ^b   Lumsdaine, Andrew ^a  

^a INDIANA UNIVERSITY   (United States)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; BANDWIDTH; COMPUTER NETWORKS; INTERCONNECTION NETWORKS; SWITCHES; SWITCHING CIRCUITS; TELECOMMUNICATION SYSTEMS; UBIQUITOUS COMPUTING;

APPLICATION PERFORMANCES; BISECTION BANDWIDTHS; CENTRAL SWITCHES; COMMUNICATION LIBRARIES; COMMUNICATION PATHS; COMMUNICATION PATTERNS; CROSS-BARS; HIGH-PERFORMANCE COMPUTING; INTERNAL CHARACTERISTICS; MULTISTAGE INTERCONNECTION NETWORKS; MULTISTAGE SWITCHES;

TELECOMMUNICATION NETWORKS;

EID: 57949093796     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2008.4663762     Document Type: Conference Paper

References (30)

1. J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, 2003.
2. S. A. Browning, "The tree machine: a highly concurrent computing environment," Ph.D. dissertation, Pasadena, CA, USA, 1980.
3. C. E. Leiserson, "Fat-trees: universal networks for hardware-efficient supercomputing," IEEE Trans. Comput., vol. 34, no. 10, pp. 892-901, 1985.
4. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic Press, 1965.
5. C. Clos, "A study of non-blocking switching networks," Bell System Technology Journal, vol. 32, pp. 406-424, 1953.
6. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, CA, USA: Morgan Kaufmann Publishers, 1992.
7. M. D. Schroeder, A. Birell, M. Burrows, H. Murray, R. Needham, T. Rodeheffer, E. Satterthwaite, and C. Thacker, "Autonet: A high-speed, self-configuring local area network using pointto -point links," IEEE Journal on Selected Areas in Communications, vol. 9, no. 8, 10 1991.
8. C. E. Leiserson and B. M. Maggs, "Communication-efficient parallel algorithms for distributed random-access machines," Algorithmica, vol. 3, pp. 53-77, 1988. [Online]. Available: citeseer.ist.psu.edu/ leiserson88communicationefficient.html
9. F. Petrini and M. Vanneschi, "K-ary n-trees: High performance networks for massively parallel architectures," Tech. Rep., 1995.
10. F. Petrini, J. Fernandez, E. Frachtenberg, and S. Coll, "Scalable collective communication on the asci q machine," in Hot Interconnects 12, 08 2003.
11. E. Zahavi, "Optimized infiniband fat-tree routing for shift all-to-all communication patterns," in Proceedings of the International Supercomputing Conference 2007 (ISC07), Dresden, Germany.
12. G. Pfister, M. Gusat, W. Denzel, D. Craddock, N. Ni, W. Rooney, T. Engbersen, R. Luijten, R. Krishnamurthy, and J. Duato, "Solving hot spot contention using infiniband architecture congestion control," in Proceedings HP-IPC 2005, Research Triangle Park, NC, 6 2005.
13. G. F. Pfister and V. A. Norton, ""Hot Spot" Contention and Combining in Multistage Interconnection Networks." in ICPP, 1985, pp. 790-797.
14. X. Lin, Y. Chung, and T. Huang, "A multiple lid routing scheme for fat-tree-based infiniband networks," in Proceedings of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS04), Sana Fe, NM, 04 2004, p. 11a.
15. Z. Ding, R. R. Hoare, A. K. Jones, and R. Melhem, "Level-wise scheduling algorithm for fat tree interconnection networks," in SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing. Tampa, Florida: ACM, 2006, p. 96.
16. J. C. Martínez, J. Flich, A. Robles, P. López, and J. Duato, "Supporting fully adaptive routing in infiniband networks," in IPDPS '03: Proceedings of the 17th International Symposium on Parallel and Distributed Processing. Washington, DC, USA: IEEE Computer Society, 2003, p. 44.1.
17. J. Sancho, J. Flich, A. Robles, P. Lopez, and J. Duato, "Performance evaluation of up*/down* routing using virtual channels for infiniband networks," in Actas de las XII Jornadas de Paralelismo, Valencia, Espaa, 2001.
18. D. Turner, A. Oline, X. Chen, and T. Benjegerdes, "Integrating new capabilities into netpipe." in Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29 - October 2, 2003, Proceedings, ser. Lecture Notes in Computer Science, J. Dongarra, D. Laforenza, and S. Orlando, Eds., vol. 2840. Springer, 2003, pp. 37-44.
19. A. Vishnu, M. Koop, A. Moody, A. R. Mamidala, S. Narravula, and D. K. Panda, "Hot-spot avoidance with multi-pathing over infiniband: An mpi perspective," in CCGRID '07: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid. Washington, DC, USA: IEEE Computer Society, 2007, pp. 479-486.
20. G. M. Shipman, T. S. Woodall, R. L. Graham, A. B. Maccabe, and P. G. Bridges, "Infiniband scalability in open mpi," in Proceedings of IEEE Parallel and Distributed Processing Symposium, April 2006.
21. S. Sur, M. J. Koop, and D. K. Panda, "High-performance and scalable mpi over infiniband with reduced memory usage: an in-depth performance analysis," in SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing. New York, NY, USA: ACM, 2006, p. 105.
22. A. Friedley, T. Hoefler, M. L. Leininger, and A. Lumsdaine, "Scalable High Performance Message Passing over InfiniBand for Open MPI," in Proceedings of 2007 KiCC Workshop, RWTH Aachen, December 2007.
23. M. J. Koop, S. Sur, Q. Gao, and D. K. Panda, "High performance MPI design using unreliable datagram for ultra-scale InfiniBand clusters," in Proceedings of the 21st annual international conference on Supercomputing. New York, NY, USA: ACM Press, 2007, pp. 180-189.
24. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman, "LogGP: Incorporating Long Messages into the LogP Model," Journal of Parallel and Distributed Computing, vol. 44, no. 1, pp. 71-79, 1995. [Online]. Available: citeseer.ist.psu.edu/article/alexandrov95loggp.html
25. R. V. Boppana and S. Chalasani, "A comparison of adaptive wormhole routing algorithms," SIGARCH Comput. Archit. News, vol. 21, no. 2, pp. 351-360, 1993.
26. T. Hoefler, T. Schneider, and A. Lumsdaine, "Accurately Measuring Collective Operations at Massive Scale," 04 2008, accepted for publication at the PMEO-PDS08 workshop at the IPDPS08.
27. M. Matsumoto and T. Nishimura, "Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator," in ACM Trans. on Modeling and Computer Simulations, 1998.
28. C. L. Janssen, I. B. Nielsen, M. L. Leininger, E. F. Valeev, and E. T. Seidl, "The massively parallel quantum chemistry program (mpqc), version 2.3.0," 2004, sandia National Laboratories, Livermore, CA, USA.
29. D. Hengsen, R. Finkel, and U. Manber, "Two Algorithms for Barrier Synchronization," Int. J. Parallel Program., vol. 17, no. 1, pp. 1-17, 1988.
30. J. Pjesivac-Grbovic, T. Angskun, G. Bosilca, G. E. Fagg, E. Gabriel, and J. J. Dongarra, "Performance Analysis of MPI Collective Operations," in Proceedings of the 19th International Parallel and Distributed Processing Symposium, 4th International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS 05), Denver, CO, April 2005.