Fat tree

From Wikipedia, the free encyclopedia
A fat tree.

The fat tree network, invented by Charles E. Leiserson of MIT, is a universal network for provably efficient communication.[1] Unlike an ordinary computer scientist's notion of a tree, which has "skinny" links all over, the links in a fat-tree become "fatter" as one moves up the tree towards the root. By judiciously choosing the fatness of links, the network can be tailored to efficiently use any bandwidth made available by packaging and communications technology. In contrast, other communications networks, such as hypercubes and meshes, have communication requirements that follow a prespecified mathematical law, and therefore cannot be tailored to specific packaging technologies.

Uses

The Connection Machine Model CM5 supercomputer (circa 1990) used a fat tree interconnection network.

Mercury Computer Systems used a hypertree network, a variant of fat trees, in their multicomputer. From 2 to 360 compute nodes would reside in a circuit switched fat tree network, with each node having local memory that could be mapped by any other node. Each node in this heterogeneous system could be an Intel i860, a PowerPC, or a group of three SHARC DSPs. The fat tree network was particularly well suited to the FFT, which customers used for signal processing tasks like radar, sonar, medical imaging, and so on.

A fat tree network is now preferred[citation needed] for the Infiniband cluster architecture.

Related topologies

In late August 2008, a team of computer scientists at UCSD published a scalable design for network architecture[2] 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 a Clos 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.

Further reading

Advanced Computer Architectures: A Design Space Approach, D. Sima, T. Fountain and P. Kacsuk, Addison- Wesley, 1997.

References

  1. ↑ Charles E. Leiserson Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Transactions on Computers, Vol. 34 , no. 10, Oct. 1985, pp. 892-901.
  2. ↑ Al-Fares, Loukissas, Vahdat, A Scalable, Commodity Data Center Network Architecture, proceedings of SIGCOMM, 2008.


Arrangements of the data links and nodes of computer networks


This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.