From Wikipedia, the free encyclopedia
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-up complete binary tree of depth d.
- "Parallel Programming in C with MPI and OpenMP", by Michael J. Quinn, pp.31, 32
- Mengjou Lin, Rose Tsang, David H. C. Du. Alan E. Klietz and Stephen Saroff, "Performance Evaluation of the CM-5 Interconnection Network", Compcon ( ACM/IEEE conference on Supercomputing), Spring'93, Digest of Papers, 1993, pp. 189-198
- Goodman, J.R.,Sequin, C.H. " Hypertree: A Multiprocessor Interconnection Topology", IEEE Transactions on Computers, vol. 20, no. 12, 1981, pp. 923-933, doi:10.1109/TC.1981.1675731
- 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" Proceeding of Parallel Algorithms and Architectures Symposium: June 29 - July 1, 1992.
|This computer networking article is a stub. You can help Wikipedia by expanding it.|