Referenced Items are not available for this document.
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 [n/2] routing steps. We also give routing algorithms that achieve tight time bounds for n leqslant 7.
Published in:
Parallel Processing, 1994. Vol. 1. ICPP 1994. International Conference on
(Volume:3
)
Date of Conference: 15-19 Aug. 1994
- Page(s):
- 167 - 171
- ISSN :
- 0190-3918
- Print ISBN:
- 0-8493-2493-9
- Conference Location :
- North Carolina State University, NC, USA
- Digital Object Identifier :
- 10.1109/ICPP.1994.141
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
