Abstract
A family of graphs optimized as the topologies for interconnection networks is proposed. The needs of such topologies with minimal diameters and minimal mean path lengths are met by special constructions of the weight vectors in a representation of the symplectic algebra. Such design of topologies can conveniently reconstruct the mesh and hypercube, widely used as network topologies, as well as many other classes of graphs potentially suitable for network topologies.
Original language | English (US) |
---|---|
Article number | 1850048 |
Journal | International Journal of Modern Physics C |
Volume | 29 |
Issue number | 7 |
DOIs | |
State | Published - Jul 1 2018 |
Keywords
- Supercomputer network topologies
- graph theory
- group theory
- roots and weights lattices
- symplectic algebra
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Mathematical Physics
- General Physics and Astronomy
- Computer Science Applications
- Computational Theory and Mathematics