## Eigenanalysis-based task mapping on parallel computers with cellular networks

- Peng Zhang, Yu-Xiang Gao, Janet Fierson, Yuefan Deng
- Math. Comput.
- 2014

1 Excerpt

- Published 2017 in ArXiv

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. MSC-class: 94C15, 68R10, 68M10, 22D10 ACM-class: C.2.1; G.2.0; G.2.1; G.2.2

@article{Ramos2017SymmetryguidedDO,
title={Symmetry-guided design of topologies for supercomputer networks},
author={Alexandre F. Ramos and Yuefan Deng},
journal={CoRR},
year={2017},
volume={abs/1706.09506}
}