- Hypertree network
A hypertree network is a
network topology that shares some traits with the binarytree network . "Parallel Programming in C with MPI and OpenMP", by Michael J. Quinn, [http://books.google.com/books?id=tDxNyGSXg5IC&pg=PA31&dq=%22hypertree+network%22&ei=VIjuSKKgOKGutgPLgI3RBg&sig=ACfU3U30rkUn-h6_ISrG1ItRqgQgONDXCg pp.31, 32] ] It is a variation of thefat tree architecture.A hypertree of degree "k" depth "d" may be visualized as a 3-dimensional object whose front view is the top-down complete
k-ary tree of depth "d" and the side view is the bottom-upcomplete binary tree of depth "d".Hypertrees were proposed in 1981 by
James R. Goodman andCarlo Sequin . [Goodman, J.R.,Sequin, C.H. " Hypertree: A Multiprocessor Interconnection Topology", "IEEE Transactions on Computers ," vol. 20, no. 12, 1981, pp. 923-933, doi|0.1109/TC.1981.1675731 ]Hypertrees are a choice for parallel
computer architecture , used, e.g., in theconnection machine CM-5.Mengjou Lin, Rose Tsang, and David H.C. Du Alan E. Klietz and Stephen Saroff, "Performance Evaluation of the CM-5 Interconnection Network", "Compcon " ( ACM/IEEE conference onSupercomputing ), Spring'93, Digest of Papers, 1993, pp. 189-198] [C. E. Leiserson. Z. S. Abuhamdeh. D. C. Douglas. C. R. Feynman. M. N. Ganmukhi. J. V. Hill. W. D. Hillis. B. C. Kuszmaul. M. A. St. Pierre. D. S. Wells.M. C. Wong. S Yang. R. Zak. "The network architecture of the connection machine CM-5". In" Proceedingof Parallel Algorithms and Architectures Symposium": June 29 - July 1 1992.]References
Wikimedia Foundation. 2010.
