A comparison of wormhole-routed interconnection networks

Fat-trees and low dimensional cubes have raised a great interest in the scientific community in the last few years and are emerging standards in the design of interconnection networks for massively parallel computers. In this paper we compare the communication performance of these two classes of interconnection networks using a detailed simulation model which describes both the interconnection network and the memory hierarchy of the processing nodes. The comparison is made with a real parallel algorithm, the transpose FFT algorithm, taking into account physical constraints, as pin and bandwidth limitations, and the router complexity