Pruned three-dimensional toroidal networks

DOI10.1016/S0020-0190(98)00164-1MaRDI QIDQ293439zbMATH OpenFDO

Authors 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

torusCayley graphinterconnection networksManhattan street networkprocessor arraypruning strategy

Mathematics Subject Classification ID

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

Recommendations

• Comparing four classes of torus-based parallel architectures: network parameters and communication performance
• Incomplete k-ary n-cube and its derivatives.
• Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
• scientific article; zbMATH DE number 1034103
• Optimal three-dimensional layout of interconnection networks

Cites work

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

Cited in

(4)

• Comparing four classes of torus-based parallel architectures: network parameters and communication performance
• The triangular pyramid: Routing and topological properties
• Incomplete k-ary n-cube and its derivatives.
• Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293439)