Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks

DOI10.1080/00207160.2011.562893zbMath1237.68025MaRDI QIDQ2885499

Wenjun Xiao, Behrooz Parhami, Wenhong Wei, Weidong Chen, Ming-Xin He

Publication date: 23 May 2012

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.8300

zbMATH Keywords

bipartite graph; fault tolerance; Hamiltonian cycle; interconnection network; node-disjoint paths; hierarchical network; network diameter; OTIS network; swapped network; internode distance; shortest-path routing; Cayley graph/digraph

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68M07: Mathematical problems of computer architecture

Related Items

Fault isolation and identification in general biswapped networks under the PMC diagnostic model

Cites Work

• Unnamed Item
• Unnamed Item
• Fully symmetric swapped networks based on bipartite cluster connectivity
• Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
• Swapped interconnection networks: Topological, performance, and robustness attributes
• Group Action Graphs and Parallel Architectures
• A group-theoretic model for symmetric interconnection networks
• Some mathematical properties of cayley digraphs with applications to interconnection network design