Symmetry-guided design of topologies for supercomputer networks

2017/06/28 by Ramos, Alexandre F., Deng, Yuefan
#22D10 #68M10 #68R10 #94C15 #C.2.1 #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.0 #G.2.1 #G.2.2

paper · doi:10.48550/arxiv.1706.09506

Abstract

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.

Related

• Projective Networks: Topologies for Large Parallel Computer Systems
• Symmetric Interconnection Networks from Cubic Crystal Lattices
• Automated Design of Torus Networks
• Constructing directed networks with a desired minimum balanced coloring
• A New Fault-Tolerant M-network and its Analysis