Optimal broadcast in all-port wormhole-routed hypercubes

Ching Tien Ho, Ming Yang Kao

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


We give an optimal algorithm that broadcasts on an n-dimensional hypercube in Θ(n/log2(n+ 1)) routing steps with wormhole, e-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires ⌈n/2⌉ routing steps. We also give routing algorithms that achieve tight time bounds for n ≤ 7.

Original languageEnglish (US)
Article number5727852
Pages (from-to)III167-III171
JournalProceedings of the International Conference on Parallel Processing
StatePublished - 1994
Event23rd International Conference on Parallel Processing, ICPP 1994 - Raleigh, NC, United States
Duration: Aug 15 1994Aug 19 1994

ASJC Scopus subject areas

  • Software
  • General Mathematics
  • Hardware and Architecture


Dive into the research topics of 'Optimal broadcast in all-port wormhole-routed hypercubes'. Together they form a unique fingerprint.

Cite this