Design and analysis of pipelined broadcast algorithms for the all-port interlaced bypass torus networks

Peng Zhang, Yuefan Deng

Research output: Contribution to journalArticlepeer-review


Broadcast algorithms for the interlaced bypass torus networks (iBT networks) are introduced to balance the all-port bandwidth efficiency and to avoid congestion in multidimensional cases. With these algorithms, we numerically analyze the dependencies of the broadcast efficiencies on various packet-sending patterns, bypass schemes, network sizes, and dimensionalities and then strategically tune up the configurations for minimizing the broadcast steps. Leveraging on such analysis, we compare the performance of networks with one million nodes between two cases: one with an added fixed-length bypass links and the other with an added torus dimension. A case study of iBT(1000 2; b = (8, 32)) and Torus(1003) shows that the former improves the diameter, average node-to-node distance, rectangular and global broadcasts over the latter by approximately 80 percent. It is reaffirmed that strategically interlacing short bypass links and methodically utilizing these links is superior to adding dimensionalities to torus in achieving shorter diameter, average node-to-node distances and faster broadcasts.

Original languageEnglish (US)
Article number6171171
Pages (from-to)2245-2253
Number of pages9
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number12
StatePublished - 2012


  • Parallel computing
  • broadcast
  • collective communication
  • interlaced bypass torus
  • network performance

ASJC Scopus subject areas

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


Dive into the research topics of 'Design and analysis of pipelined broadcast algorithms for the all-port interlaced bypass torus networks'. Together they form a unique fingerprint.

Cite this