Leaf communications in trees and fat trees (1994) [1 citations — 1 self]
Download:
|
|
by Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos
http://hermes.ece.uvic.ca/DOCUMENTS/WWW_LAPIS/reports/tr94-7.ps.gz
Add To MetaCart
Abstract:
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. Here we study the communication capabilities of binary fat trees 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.
Citations
| 226 | Optimum Broadcasting and Personalized Communication in Hypercubes – Johnsson, Ho - 1989 |
| 153 | Fat-trees: Universal networks for hardwareefficient supercomputing – Leiserson - 1985 |
| 78 | Communication efficient basic linear algebra computations on hypercube system – Johnsson - 1987 |
| 38 | Data communication in parallel architectures – Saad, Schultz - 1989 |
| 31 | Multicast communication in multicomputer networks – Lin, Ni - 1993 |
| 21 | Leiserson et al., "The Network Architecture of the Connection Machine CM-5 – E - 1992 |
| 19 | On the Impact of Communication Complexity in the Design of Parallel Numerical Algorithms – Gannon, Rosendale - 1984 |
| 11 | Scheduling Regular and Irregular Communication Patterns on the CM-5 – Ponnusamy, Thakur, et al. - 1992 |
| 9 | Scattering and Gathering Messages in Networks of Processors – Bhatt, Pucci, et al. - 1993 |
| 4 | Concurrent broadcast for information dissemination – Topkins - 1985 |
