Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 213-222 |
Number of pages | 10 |
Journal | Parallel Processing Letters |
Volume | 5 |
Issue number | 2 |
DOIs | |
State | Published - Jan 1 1995 |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture