Pruned three-dimensional toroidal networks

DOI10.1016/S0020-0190(98)00164-1zbMath1339.68207MaRDI QIDQ293439

Ding-Ming Kwai, Behrooz Parhami

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001641?np=y

zbMATH Keywords

Cayley graphtorusinterconnection networksManhattan street networkprocessor arraypruning strategy

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks ⋮ Comparing four classes of torus-based parallel architectures: network parameters and communication performance ⋮ The triangular pyramid: Routing and topological properties

Cites Work

• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• A group-theoretic model for symmetric interconnection networks
• Design and analysis of multidimensional Manhattan street networks

This page was built for publication: Pruned three-dimensional toroidal networks