论文信息 - Symmetry-guided design of topologies for supercomputer networks

Symmetry-guided design of topologies for supercomputer networks

A family of graphs optimized as the topologies for supercomputer interconnection networks is proposed. The special needs of such network topologies, minimal diameter and mean path length, are met by special constructions of the weight vectors in a representation of the symplectic algebra. Such theoretical design of topologies can conveniently reconstruct the mesh and hypercubic graphs, widely used as today's network topologies. Our symplectic algebraic approach helps generate many classes of graphs suitable for network topologies.

Yuefan Deng | Alexandre F. Ramos | Alexandre F. Ramos | Yuefan Deng

[1] Pedro López,et al. Towards an Efficient Fat-Tree like Topology , 2012, Euro-Par.

[2] Yuefan Deng,et al. Symmetry insights for design of supercomputer network topologies: roots and weights lattices , 2012 .

[3] Jack J. Dongarra. Architecture-aware Algorithms and Software for Peta and Exascale Computing , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[4] Sudhakar Yalamanchili,et al. Interconnection Networks , 2011, Encyclopedia of Parallel Computing.

[5] Kemal Efe. A Variation on the Hypercube with Lower Diameter , 1991, IEEE Trans. Computers.

[6] F. Harary,et al. A survey of the theory of hypercube graphs , 1988 .

[7] Stephen S. Pawlowski,et al. Exascale science: the next frontier in high performance computing , 2010, ICS '10.

[8] William J. Dally,et al. Principles and Practices of Interconnection Networks , 2004 .

[9] Peng Zhang,et al. Eigenanalysis-based task mapping on parallel computers with cellular networks , 2014, Math. Comput..

[10] P Kogge,et al. The tops in flops , 2011, IEEE Spectrum.

[11] B. G. Wybourne,et al. Classical Groups for Physicists , 1974 .