Issue No.12 - December (1981 vol.30)
J.R. Goodman , Department of Computer Sciences, University of Wisconsin
A new interconnection topology for incrementally expansible multicomputer systems is described, which combines the easy expansibility of tree structures with the compactness of the n-dimensional hypercube. The addition of n-cube links to the binary tree structure provides direct paths between nodes which have frequent data exchange in algorithms such as sorting and fast Fourier transforms (FFT's). The derivation of a family of such Hypertree structures is outlined, and the basic properties such as average path length, uniformity of the distribution of message traffic, and routing algorithms are analyzed.
tree structure, Communication networks, hypercube, message traffic, multicomputers, routing algorithms
J.R. Goodman, C.H. Sequin, "Hypertree: A Multiprocessor Interconnection Topology", IEEE Transactions on Computers, vol.30, no. 12, pp. 923-933, December 1981, doi:10.1109/TC.1981.1675731