#### DMCA

## Broadcast and Associative Operations on Fat-Trees (1996)

Citations: | 2 - 0 self |

### Citations

1373 | A bridging model for parallel computation, - Valiant - 1990 |

560 | LogP: Towards a realistic Model for Parallel Computation, - Culler, Karp, et al. - 1993 |

291 |
Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing”,
- Leiserson
- 1985
(Show Context)
Citation Context ...urs, but similar in spirit, see [LM88].) Indeed, it can be shown that a specific fat-tree with good routing properties can simulate an ideal fat-tree with moderate slowdown. Technically, we have (see =-=[Lei85]-=- for the definition of the load factor ): Theorem 1 Let F be a fat-tree network of N leaves with capacity function w(n), such that a set of messages of load factorscan be routed on line, in time O(s(N... |

118 | Designing broadcasting algorithms in the postal model for message-passing systems.
- Bar-Noy, Kipnis
- 1994
(Show Context)
Citation Context ...el computation, it has been widely studied in many different models. Among the most similar to the ideal fat-tree are a number of models based on bandwidth/latency parameters such as the postal model =-=[BK92]-=-, LogP [CK+93, KSSS93], BSP [Va90, BHPPS96], and the ring of processors of [RSS94] where messages can cross k links in time O(log k) (modeling the use of cascaded drivers to accelerate message transmi... |

86 | Randomized routing and sorting on fixed-connection networks
- Leighton, Maggs, et al.
- 1994
(Show Context)
Citation Context ...al fat-tree with the same capacity function w(n) with slowdown O(s(N) + d(N)). As an example, for the randomized routing of constant-size messages on the butterfly fat-tree, s(N) = 1 and d(N) = log N =-=[LMRR94]-=-; thus, the slowdown to simulate an ideal fat-tree according to the preceding theorem would be O(log N ). For for the deterministic routing of O(log N)-size 4 messages on the sorting fat-tree, s(N) = ... |

77 | Universal packet routing algorithms - Leighton, Maggs, et al. - 1988 |

73 | The network architecture of the Connection Machine CM-5 - Pierre, Wong, et al. - 1996 |

57 | Optimal Broadcast and Summation in the LogP Model. - Karp, Sahay, et al. - 1993 |

35 | Communication-efficient parallel algorithms for distributed random-access machines
- Leiserson, Maggs
- 1988
(Show Context)
Citation Context ...capacity and distance constraints. We propose the ideal fat-tree as a potentially portable abstraction for the class of fat-tree networks. (For a model different from ours, but similar in spirit, see =-=[LM88]-=-.) Indeed, it can be shown that a specific fat-tree with good routing properties can simulate an ideal fat-tree with moderate slowdown. Technically, we have (see [Lei85] for the definition of the load... |

32 | BSP vs. LogP - Bilardi, Herley, et al. - 1996 |

24 |
Deterministic On-Line Routing on Area-Universal Networks,” JACM
- Bay, Bilardi
- 1995
(Show Context)
Citation Context ...imulate an ideal fat-tree according to the preceding theorem would be O(log N ). For for the deterministic routing of O(log N)-size 4 messages on the sorting fat-tree, s(N) = log N and d(N) = log 2 N =-=[BB95]-=-, yielding a slowdown of O(log 2 N ). We develop algorithms and derive lower bounds for a fat-tree with a general capacity function w(n), simply assuming two natural constraints: 1. w(2n)sw(n), that i... |

24 | The fat-pyramid and universal parallel computation independent of wire delay - Greenberg - 1994 |

9 | Randomized routing on fat-trees - Greenberg, Leiserson - 1989 |

8 |
An area-universal VLSI circuit, in
- Bay, Bilardi
- 1993
(Show Context)
Citation Context ...nd channel capacities. Fat-trees have interesting universality properties in VLSI and form the basis for a number of universal routers [Lei85, GL89, LMR88, BB95, Gre94, BCDM94] and universal circuits =-=[BB93]-=-. The CM-5 parallel supercomputer uses a fat-tree as its interconnection pattern [LAD+92]. In spite of its wide use, the term fat-tree has not been defined precisely. A definition useful for the study... |

5 |
Area Lower Bound for a Class of Fat-Trees
- Bilardi, Bay
- 1994
(Show Context)
Citation Context ...s a fat-tree as its interconnection pattern [LAD+92]. In spite of its wide use, the term fat-tree has not been defined precisely. A definition useful for the study of layout area has been proposed in =-=[BB94]-=-. This research was partially supported by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (Project GEPPCOM). y DEI, Universit`a di Padova, Padova (Italy) and EECS, Universit... |

3 | A lower bound on area-universal graphs - Bilardi, Chauduri, et al. - 1994 |

2 | The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations
- ROSENBERG, SCARANO, et al.
- 1997
(Show Context)
Citation Context ...st similar to the ideal fat-tree are a number of models based on bandwidth/latency parameters such as the postal model [BK92], LogP [CK+93, KSSS93], BSP [Va90, BHPPS96], and the ring of processors of =-=[RSS94]-=- where messages can cross k links in time O(log k) (modeling the use of cascaded drivers to accelerate message transmission along MOS lines). Clearly, broadcast algorithms for most models resemble eac... |