Hypertree network

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

A hypertree network is a network topology that shares some traits with the binary tree network.[1] It is a variation of the fat tree architecture.[2]

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.[1]

Hypertrees were proposed in 1981 by James R. Goodman and Carlo Sequin.[3]

Hypertrees are a choice for parallel computer architecture, used, e.g., in the connection machine CM-5.[2][4]


  1. 1.0 1.1 "Parallel Programming in C with MPI and OpenMP", by Michael J. Quinn, pp.31, 32
  2. 2.0 2.1 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
  3. 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
  4. 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.