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]
References
- ^ a b Quinn, Michael Jay (2004). Parallel Programming in C with MPI and OpenMP. McGraw-Hill. pp. 31–32. ISBN 978-0-07-282256-4.
- ^ a b Lin, M.; Tsang, R.; Du, D.H.C.; Klietz, A.E.; Saroff, S. (1993). "Performance evaluation of the CM-5 interconnection network". Digest of Papers. Compcon Spring, San Francisco, CA, USA, 1993. pp. 189–198. doi: 10.1109/CMPCON.1993.289662. ISBN 978-0-8186-3400-0. S2CID 10122972.
- ^ Goodman, J.R.; Sequin, C.H. (1981). "Hypertree: A Multiprocessor Interconnection Topology" (PDF). IEEE Transactions on Computers. 20 (12): 923–933. doi: 10.1109/TC.1981.1675731. S2CID 20537503.
- ^ Leiserson, Charles E.; Abuhamdeh, Zahi S.; Douglas, David C.; Feynman, Carl R.; Ganmukhi, Mahesh N.; Hill, Jeffrey V.; Daniel Hillis, W.; Kuszmaul, Bradley C.; St. Pierre, Margaret A.; Wells, David S.; Wong, Monica C.; Yang, Shaw-Wen; Zak, Robert (1992). "The Network Architecture of the Connection Machine CM-5". SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures. ACM. pp. 272–285. doi: 10.1145/140901.141883. ISBN 978-0-89791-483-3. S2CID 6307237.
 | This computer networking article is a stub. You can help Wikipedia by expanding it. |
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]
References
- ^ a b Quinn, Michael Jay (2004). Parallel Programming in C with MPI and OpenMP. McGraw-Hill. pp. 31–32. ISBN 978-0-07-282256-4.
- ^ a b Lin, M.; Tsang, R.; Du, D.H.C.; Klietz, A.E.; Saroff, S. (1993). "Performance evaluation of the CM-5 interconnection network". Digest of Papers. Compcon Spring, San Francisco, CA, USA, 1993. pp. 189–198. doi: 10.1109/CMPCON.1993.289662. ISBN 978-0-8186-3400-0. S2CID 10122972.
- ^ Goodman, J.R.; Sequin, C.H. (1981). "Hypertree: A Multiprocessor Interconnection Topology" (PDF). IEEE Transactions on Computers. 20 (12): 923–933. doi: 10.1109/TC.1981.1675731. S2CID 20537503.
- ^ Leiserson, Charles E.; Abuhamdeh, Zahi S.; Douglas, David C.; Feynman, Carl R.; Ganmukhi, Mahesh N.; Hill, Jeffrey V.; Daniel Hillis, W.; Kuszmaul, Bradley C.; St. Pierre, Margaret A.; Wells, David S.; Wong, Monica C.; Yang, Shaw-Wen; Zak, Robert (1992). "The Network Architecture of the Connection Machine CM-5". SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures. ACM. pp. 272–285. doi: 10.1145/140901.141883. ISBN 978-0-89791-483-3. S2CID 6307237.
|
| This computer networking article is a stub. You can help Wikipedia by expanding it. |