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.

A comparison of wormhole-routed interconnection networks

VANNESCHI, MARCO
1997

Abstract

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/54870
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact