Embedding arbitrary binary trees in a hypercube
Journal Article
·
· Journal of Parallel and Distributed Computing; (USA)
- Dept. of Computer Science, Univ. of British Columbia, Vancouver, British Columbia (CA)
An important issue in the design of algorithms for a hypercube multiprocessor is to minimize communication overhead by matching the computational structure of the algorithm to the underlying physical structure of the machine. One computational structure of particular interest is binary trees. Although in general any tree can be embedded in a sufficiently large hypercube in practice it is important to minimize the number of dimensions needed by the embedding. The algorithm presented in this paper embeds an {ital N} node binary tree into a hypercube with expansion {ital O}(log{ital N}) and unit dilation.
- OSTI ID:
- 6960966
- Journal Information:
- Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 7:3; ISSN JPDCE; ISSN 0743-7315
- Country of Publication:
- United States
- Language:
- English
Similar Records
Dynamic embedding of trees in hypercubes with constant dilation and load. Memorandum report
Embedding of tree networks into hypercubes
Theoretical and experimental approaches for the hypercube-embedding problem
Technical Report
·
Mon May 01 00:00:00 EDT 1989
·
OSTI ID:5173478
Embedding of tree networks into hypercubes
Journal Article
·
Thu Aug 01 00:00:00 EDT 1985
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6777908
Theoretical and experimental approaches for the hypercube-embedding problem
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1990
·
OSTI ID:5431083