F. Petrini and M. Vanneschi, "k-ary n-trees: High Performance Networks for Massively Parallel Architectures, " in Proceedings of the 11th International Parallel Processing Symposium, IPPS'97, (Geneva, Switzerland) , pp. 87--93, April 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Configuration of Switch-Based Networks with Wormhole Switching - Lee, Hong, Kim (Correct)
....fat tree configurations to realize their structural strengths and to take into account the characteristics of the currently developed switches. The investigation to implement efficiently routing mechanisms on fat trees is lacking in spite of their structural strengths. Several researches [20 22] addressed the routing methods on systemes configured as complete fat trees but did not study the routing scheme on incomplete fat tree structures and not consider the characteristics of the characteristics of recent switches. We propose an efficient routing algorithm and unicast based ....
F. Petrini and M. Vanneschi, "k-ary n-trees: High Performance Networks for Massively Parallel Architectures," International Parallel Processing Symposium, pp. 87-93, 1997.
Network Performance under Physical Constraints - Petrini, Vanneschi (1997) Self-citation (Petrini Vanneschi) (Correct)
....have been proposed that use building blocks with fixed arity [19] These solutions trade connectivity with simplicity: incoming messages at a given switch in a full fat tree may have more choices in the routing decision than in a corresponding network with fixed arity switches. k ary n trees [20] are a particular subclass of the fattrees and borrow from the k ary n butterflies [21] the topology of the internal switches. A k ary n tree has k n leaf nodes and n levels of k n Gamma1 switches. Each switch has 2k links. A 4 ary 2 tree is shown in Figure 2 Minimal adaptive routing between a ....
F. Petrini and M. Vanneschi, "k-ary n-trees: High Performance Networks for Massively Parallel Architectures, " in Proceedings of the 11th International Parallel Processing Symposium, IPPS'97, (Geneva, Switzerland) , pp. 87--93, April 1997.
Efficient Personalized Communication on Wormhole Networks - Petrini, Vanneschi (1997) Self-citation (Petrini Vanneschi) (Correct)
....description of a class of such permutations, defined as congestion free. Figure 3: A 4 ary 2 tree is composed of 16 leaf nodes and 2 levels with 4 switches on each level. A packet can follow any minimal path passing through a nearest common ancestor of source and destination. k ary n trees [36] are a particular subclass of the fattrees and borrow from the k ary n butterflies [37] the topology of the internal switches. A k ary n tree has k n leaf nodes and n levels of k n Gamma1 switches. Each switch has 2k links. A 4 ary 2 tree is shown in Figure 3 Minimal adaptive routing between a ....
F. Petrini and M. Vanneschi, "k-ary n-trees: High Performance Networks for Massively Parallel Architectures, " in Proceedings of the 11th International Parallel Processing Symposium, IPPS'97, (Geneva, Switzerland), pp. 87--93, April 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC