Communications in Binary Fat Trees

Fat trees are built around complete b-ary trees but have processing nodes only at the leaf level and may have different branch capacities in different levels. In this paper we study the communication capabilities of binary fat trees (including the simple binary tree) with respect to five major communication operations: broadcasting, multinode broadcasting, scattering, gathering and total exchange. We present and analyse optimal and nearly optimal algorithms for the five operations.

[1]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[2]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[3]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[4]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[5]  Xiaola Lin,et al.  Multicast Communication in Multicomputer Networks , 1993, ICPP.

[6]  Dennis Gannon,et al.  On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms , 1984, IEEE Transactions on Computers.

[7]  Yousef Saad,et al.  Data communication in parallel architectures , 1989, Parallel Comput..

[8]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[9]  Arnold L. Rosenberg,et al.  Scattering and Gathering Messages in Networks of Processors , 1993, IEEE Trans. Computers.

[10]  Donald M. Topkis,et al.  Concurrent Broadcast for Information Dissemination , 1985, IEEE Transactions on Software Engineering.

[11]  Geoffrey C. Fox,et al.  Scheduling regular and irregular communication patterns on the CM-5 , 1992, Proceedings Supercomputing '92.

[12]  Fikret Erçal,et al.  Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..