Comparing four classes of torus-based parallel architectures: network parameters and communication performance
DOI10.1016/j.mcm.2004.10.002zbMath1074.94535OpenAlexW2037328609MaRDI QIDQ557123
Ding-Ming Kwai, Behrooz Parhami
Publication date: 23 June 2005
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2004.10.002
\(k\)-ary \(n\)-cubeManhattan street networkAnalytic performance evaluationIncomplete torusPruned torusSymmetric networkVirtual cut-through
Circuits, networks (94C99) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Cites Work
- Pruned three-dimensional toroidal networks
- Fault diameter of interconnection networks
- Incomplete \(k\)-ary \(n\)-cube and its derivatives.
- Horizons of parallel computation
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Virtual cut-through: A new computer communication switching technique
- Design and analysis of multidimensional Manhattan street networks
- Performance analysis of virtual cut-through switching in HARTS: a hexagonal mesh multicomputer
This page was built for publication: Comparing four classes of torus-based parallel architectures: network parameters and communication performance