Hypertree network explained

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.

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.^[2]

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

Notes and References

1. Book: Quinn, Michael Jay . Parallel Programming in C with MPI and OpenMP . registration . 2004 . McGraw-Hill . 978-0-07-282256-4 . 31–32.
2. Goodman . J.R. . Sequin . C.H. . Hypertree: A Multiprocessor Interconnection Topology . . 20 . 12 . 1981 . 923–933 . 10.1109/TC.1981.1675731. 20537503 .
3. Book: M. . Lin . R. . Tsang . D.H.C. . Du . A.E. . Klietz . S. . Saroff . Performance evaluation of the CM-5 interconnection network . Digest of Papers. Compcon Spring, San Francisco, CA, USA, 1993 . 1993 . 189–198 . 10.1109/CMPCON.1993.289662. Compcon . 978-0-8186-3400-0 . 10122972 .
4. Book: Charles E. . Leiserson . Zahi S. . Abuhamdeh . David C. . Douglas . Carl R. . Feynman . Mahesh N. . Ganmukhi . Jeffrey V. . Hill . W. . Daniel Hillis . Bradley C. . Kuszmaul . Margaret A. . St. Pierre . David S. . Wells . Monica C. . Wong . Shaw-Wen . Yang . Robert . Zak . The Network Architecture of the Connection Machine CM-5 . SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures . 272–285 . ACM . 1992 . 978-0-89791-483-3 . 10.1145/140901.141883 . 6307237 .