DESIGN AND PERFORMANCE ANALYSIS OF THE PRACTICAL FAT TREE NETWORK USING A BUTTERFLY NETWORK

The Practical Fat Tree Network (PFN) is proposed as an efficient inter connection structure for parallel processing computers using a butterf ly network, It satisfies the concept of Volume universality from Leise rson's theoretical fat tree network [1]. In the fat tree network, the locality of input traffic is a very important factor because it has si gnificant effects on performance. The proposed performance model effec tively highlights this locality factor, Performance is analyzed accord ing to varing input traffic loads and buffer sizes, The accuracy of th e model is confirmed by comparing its results with those from simulati on, The proposed model is found to be very accurate, Although the PFN is a dynamic connection network, it shows low delay and high throughpu t for the applications that have locality.