Optimal Broadcast in All-Port Wormhole-Routed Hypercubes

  • Authors:
  • Ching-Tien Ho;Ming-Yang Kao

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

We give an optimal algorithm that broadcasts on an $n$-dimensional hypercube in $\Theta(n/\log_2(n+1))$ routing steps with wormhole, $e$-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires $\lceil{n/2} \rceil$ routing steps. We also give routing algorithms that achieve tight time bounds for $n \le 7$.