Loading...
Please wait, while we are loading the content...
Similar Documents
k-ary n-trees: High Performance Networks for Massively Parallel Architectures (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Petrini, Fabrizio Vanneschi, Marco |
| Description | In Proceedings of the 11th International Parallel Processing Symposium, IPPS'97 The past few years have seen a rise in popularity of massively parallel architectures that use fat-trees as their interconnection networks. In this paper we study the communication performance of a parametric family of fat-trees, the k-ary n-trees, built with constant arity switches interconnected in a regular topology. Through simulation on a 4-ary 4-tree with 256 nodes, we analyze some variants of an adaptive algorithm that utilize wormhole routing with one, two and four virtual channels. The experimental results show that the uniform, bit reversal and transpose traffic patterns are very sensitive to the flow control strategy. In all these cases, the saturation points are between 35 \Gamma 40% of the network capacity with one virtual channel, 55\Gamma60% with two virtual channels and around 75% with four virtual channels. The complement traffic, a representative of the class of the congestion-free communication patterns, reaches an optimal performance, with a saturation point at 97% of the capacity for all flow control strategies. |
| File Format | |
| Language | English |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Complement Traffic K-ary N-trees Optimal Performance Massively Parallel Architecture Virtual Channel Interconnection Network Past Year Parametric Family Communication Performance High Performance Network Utilize Wormhole Saturation Point Transpose Traffic Pattern Constant Arity Switch Flow Control Strategy Regular Topology Adaptive Algorithm Experimental Result Network Capacity Congestion-free Communication Pattern Parallel Architecture |
| Content Type | Text |
| Resource Type | Article |
