Referenced Items are not available for this document.
An efficient scheme is presented for embedding a complete binary tree architecture in a two-dimensional array of processing elements. The scheme utilizes almost 100% of the processing elements in the array as actual computing elements, with small and asymptotically optimal propagation delay. The maximum edge length is optimal for trees with up to six levels. The scheme is compared with other designs proposed in the literature and shown to be significantly better
Published in:
Distributed Computing Systems, 1988., 8th International Conference on
Date of Conference: 13-17 Jun 1988
- Page(s):
- 86 - 93
- Meeting Date :
- 13 Jun 1988-17 Jun 1988
- Print ISBN:
- 0-8186-0865-X
- INSPEC Accession Number:
- 3258476
- Conference Location :
- San Jose, CA
- Digital Object Identifier :
- 10.1109/DCS.1988.12503
- 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.
