OPTIMAL INTERCONNECTION NETWORKS FOR PARALLEL PROCESSORS: THE IMPORTANCE OF BEING SQUARE.

Clyde P. Kruskal, Marc Snir

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We present a theory that defines the performance (delay and bandwidth) and cost of packet-switching interconnection networks in terms of their geometry. This is used to prove that square banyan networks provide optimal performance versus cost. Some conjectures generalizing the results to nonsquare banyan networks are also given.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
Pages91-113
Number of pages23
StatePublished - 1987
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kruskal, C. P., & Snir, M. (1987). OPTIMAL INTERCONNECTION NETWORKS FOR PARALLEL PROCESSORS: THE IMPORTANCE OF BEING SQUARE. In Unknown Host Publication Title (pp. 91-113)