Interlacing bypass rings to torus networks for more efficient networks

Peng Zhang, Reid Powell, Yuefan Deng

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce a new technique for generating more efficient networks by systematically interlacing bypass rings to torus networks (iBT networks). The resulting network can improve the original torus network by reducing the network diameter, node-to-node distances, and by increasing the bisection width without increasing wiring and other engineering complexity. We present and analyze the statement that a 3D iBT network proposed by our technique outperforms 4D torus networks of the same node degree. We found that interlacing rings of sizes 6 and 12 to all three dimensions of a torus network with meshes 30 × 30 × 36 generate the best network of all possible networks, including 4D torus and hypercube of approximately 32,000 nodes. This demonstrates that strategically interlacing bypass rings into a 3D torus network enhances the torus network more effectively than adding a fourth dimension, although we may generalize the claim. We also present a node-to-node distance formula for the iBT networks.

Original languageEnglish (US)
Article number5467053
Pages (from-to)287-295
Number of pages9
JournalIEEE Transactions on Parallel and Distributed Systems
Volume22
Issue number2
DOIs
StatePublished - 2011

Keywords

  • bypass ring
  • network diameter
  • Network topology
  • node-to-node distance
  • routing
  • torus networks

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Interlacing bypass rings to torus networks for more efficient networks'. Together they form a unique fingerprint.

Cite this