Hypertree network

{{Short description|Type of computer/communication network topology}}

A hypertree network is a network topology that shares some traits with the binary tree network.{{cite book |first=Michael Jay |last=Quinn |title=Parallel Programming in C with MPI and OpenMP |url=https://archive.org/details/parallelprogramm0000quin |url-access=registration |year=2004 |publisher=McGraw-Hill |isbn=978-0-07-282256-4 |pages=[https://archive.org/details/parallelprogramm0000quin/page/31 31]–32}} It is a variation of the fat 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-up complete binary tree of depth d.

Hypertrees were proposed in 1981 by James R. Goodman and Carlo Sequin.{{cite journal |last1=Goodman |first1=J.R. |last2=Sequin |first2=C.H. |title=Hypertree: A Multiprocessor Interconnection Topology |journal=IEEE Transactions on Computers |volume=20 |issue=12 |year=1981 |pages=923–933 |doi=10.1109/TC.1981.1675731|s2cid=20537503 |url=https://minds.wisconsin.edu/bitstream/1793/58294/1/TR427.pdf }}

Hypertrees are a choice for parallel computer architecture, used, e.g., in the connection machine CM-5.{{cite book |first1=M. |last1=Lin |first2=R. |last2=Tsang |first3=D.H.C. |last3=Du |first4=A.E. |last4=Klietz |first5=S. |last5=Saroff |chapter=Performance evaluation of the CM-5 interconnection network |title=Digest of Papers. Compcon Spring, San Francisco, CA, USA, 1993 |year=1993 |pages=189–198 |doi=10.1109/CMPCON.1993.289662|title-link=Compcon |isbn=978-0-8186-3400-0 |s2cid=10122972 }}{{cite book |first1=Charles E. |last1=Leiserson |first2=Zahi S. |last2=Abuhamdeh |first3=David C. |last3=Douglas |first4=Carl R. |last4=Feynman |first5=Mahesh N. |last5=Ganmukhi |first6=Jeffrey V. |last6=Hill |first7=W. |last7=Daniel Hillis |first8=Bradley C. |last8=Kuszmaul |first9=Margaret A. |last9=St. Pierre |first10=David S. |last10=Wells |first11=Monica C. |last11=Wong |first12=Shaw-Wen |last12=Yang |first13=Robert |last13=Zak |chapter=The Network Architecture of the Connection Machine CM-5 |title=SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures |pages=272–285 |publisher=ACM |year=1992 |isbn=978-0-89791-483-3 |doi=10.1145/140901.141883 |s2cid=6307237 }}