Efficient broadcast on hypercubes with wormhole and e-cube routings

Ching Tien Ho*, Ming Yang Kao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We consider the problem of broadcasting on an n-dimensional hypercube with worm-hole e-cube routing, intermediate reception capability, and one-port communication. We give an algorithm, optimal to within a multiplicative constant, that broadcasts in this model in Θ(n/log2(n + 1)) routing steps. We also give routing algorithms that achieve tight time bounds for n-cubes where n ≤ 6.

Original languageEnglish (US)
Pages (from-to)213-222
Number of pages10
JournalParallel Processing Letters
Issue number2
StatePublished - Jan 1 1995

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture


Dive into the research topics of 'Efficient broadcast on hypercubes with wormhole and e-cube routings'. Together they form a unique fingerprint.

Cite this