The Community for Technology Leaders
RSS Icon
Issue No.02 - February (1995 vol.6)
pp: 200-204
<p><it>Abstract—</it>We give an optimal algorithm that broadcasts on an <math><tmath>$n$</tmath></math>-dimensional hypercube in <math><tmath>$\Theta(n/\log_2(n+1))$</tmath></math> routing steps with wormhole, <math><tmath>$e$</tmath></math>-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires <math><tmath>$\lceil{n/2} \rceil$</tmath></math> routing steps. We also give routing algorithms that achieve tight time bounds for <math><tmath>$n \le 7$</tmath></math>.</p>
Ching-Tien Ho, Ming-Yang Kao, "Optimal Broadcast in All-Port Wormhole-Routed Hypercubes", IEEE Transactions on Parallel & Distributed Systems, vol.6, no. 2, pp. 200-204, February 1995, doi:10.1109/71.342134
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool