Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Fat tree

From Wikipedia, the free encyclopedia
Universal network for provably efficient communication
icon
This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Fat tree" – news ·newspapers ·books ·scholar ·JSTOR
(August 2007) (Learn how and when to remove this message)
A fat tree
A 2-level fat tree with 8-port switches

Thefat tree network is a universalnetwork for provably efficient communication.[1] It was invented byCharles E. Leiserson of theMIT in 1985.[1] k-ary n-trees, the type of fat-trees commonly used in most high-performance networks, were initially formalized in 1997.[2]

In atreedata structure, every branch has the same thickness (bandwidth), regardless of their place in the hierarchy—they are all "skinny" (skinny in this context means low-bandwidth). In a fat tree, branches nearer the top of the hierarchy are "fatter" (thicker) than branches further down the hierarchy. In atelecommunications network, the branches aredata links; the varied thickness (bandwidth) of the data links allows for more efficient and technology-specific use.[citation needed]

Mesh andhypercube topologies have communication requirements that follow a rigid algorithm, and cannot be tailored to specific packaging technologies.[3]

Applications in supercomputers

[edit]

Supercomputers that use a fat tree network[4] include the two fastest as of late 2018,[5]Summit[6] andSierra,[7] as well asTianhe-2,[8] theMeiko Scientific CS-2,Yellowstone, theEarth Simulator, theCray X2, the Connection MachineCM-5, and variousAltix supercomputers.[citation needed]

Mercury Computer Systems applied a variant of the fat tree topology—thehypertree network—to theirmulticomputers.[citation needed] In this architecture, 2 to 360 compute nodes are arranged in acircuit-switched fat tree network.[citation needed] Each node has local memory that can be mapped by any other node.[vague] Each node in this heterogeneous system could be anIntel i860, aPowerPC, or a group of threeSHARCdigital signal processors.[citation needed]

The fat tree network was particularly well suited tofast Fourier transform computations, which customers used for suchsignal processing tasks asradar,sonar, andmedical imaging.[citation needed]

Related topologies

[edit]

In August 2008, a team ofcomputer scientists atUCSD published a scalable design for network architecture[9] that uses a topology inspired by the fat tree topology to realize networks that scale better than those of previous hierarchical networks. The architecture uses commodity switches that are cheaper and more power-efficient than high-end modular data center switches.

This topology is actually a special instance of aClos network, rather than a fat-tree as described above. That is because the edges near the root are emulated by many links to separate parents instead of a single high-capacity link to a single parent. However, many authors continue to use the term in this way.

References

[edit]
  1. ^abLeiserson, Charles E (October 1985)."Fat-trees: universal networks for hardware-efficient supercomputing"(PDF).IEEE Transactions on Computers.34 (10):892–901.doi:10.1109/TC.1985.6312192.S2CID 8927584.
  2. ^Petrini, Fabrizio (1997). "K-ary n-trees: High performance networks for massively parallel architectures".Proceedings 11th International Parallel Processing Symposium. Vol. doi: 10.1109/IPPS.1997.580853. pp. 87–93.doi:10.1109/IPPS.1997.580853.ISBN 0-8186-7793-7.S2CID 6608892.
  3. ^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.
  4. ^Yuefan Deng (2013)."3.2.1 Hardware systems: Network Interconnections: Topology".Applied Parallel Computing. World Scientific. p. 25.ISBN 978-981-4307-60-4.
  5. ^"November 2018 TOP500".TOP500. November 2018. Retrieved2019-02-11.
  6. ^"Summit - Oak Ridge National Laboratory's next High Performance Supercomputer".Oak Ridge Leadership Computing Facility. Retrieved2019-02-11.
  7. ^Barney, Blaise (2019-01-18)."Using LC's Sierra Systems - Hardware - Mellanox EDR InfiniBand Network - Topology and LC Sierra Configuration".Lawrence Livermore National Laboratory. Retrieved2019-02-11.[permanent dead link]
  8. ^Dongarra, Jack (2013-06-03)."Visit to the National University for Defense Technology Changsha, China"(PDF).Netlib. Retrieved2013-06-17.
  9. ^Al-Fares, Mohammad; Loukissas, Alexander; Vahdat, Amin (2008)."A scalable, commodity data center network architecture"(PDF).Proceedings of the ACM SIGCOMM 2008 conference on Data communication. ACM. pp. 63–74.doi:10.1145/1402958.1402967.ISBN 978-1-60558-175-0.S2CID 65842.

Further reading

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Fat_tree&oldid=1307791475"
Category:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp