Fat tree

from Wikipedia, the free encyclopedia
Fat tree topology

Fat Tree describes a network topology used primarily in the field of computer clusters . This topology is derived from a binary tree , but in the fat tree topology the lines closer to the root offer a higher bandwidth . This is indicated in the adjacent picture by thicker connections.

You can also see that the mesh on the second level is more dense than on the last level to the nodes. The advantage is that the communication between the nodes attached to the 1st and 3rd switch of the lowest level does not have to run up to the root switch. Fat Tree offers a wide range of bisection .

The enormous network load that arises in high-performance computing , depending on the application, can thus be easily managed.

literature

  • Vladimir Vishnevsky, Dmitry Kozyrev, Andrey Larionov (eds.): Distributed Computer and Communication Networks. Springer International Publishing, New York / London 2014, ISBN 978-3-319-05208-3 .
  • Curtis L. Janssen, Ida MB Nielsen: Parallel Computing in Quantum Chemistry. Taylor & Francis Group, Boca Raton 2008, ISBN 978-1-4200-5164-3 .
  • Yang Liu, Jogesh K Muppala, Malathi Veeraraghavan, Dong Lin, Mounir Hamdi: Data Center Networks. Springer International Publishing, New York / London 2013, ISBN 978-3-319-01948-2 .
  • BASU, SK: Parallel and Distributed Computing . Phi learning Private Limited, Delhi 2016, ISBN 978-81-203-5212-4 .

Web links