next up previous
Next: References Up: A Parallel Algorithm for Previous: 3.4 Removing the additional

4 Remarks

The techniques described in this paper can also be applied to other networks whose underlying structures are trees, and whose blocks are connected by expanding graphs. One example is a class of networks called multi-fat-trees, which are based on the fat-tree networks of Leiserson and Greenberg [1, 8].

Bruce Maggs
Mon Jul 22 19:56:03 EDT 1996