The Performance of Multistage Interconnection Networks for Multiprocessors

Clyde P. Kruskal, Marc Snir

Research output: Contribution to journalArticlepeer-review

Abstract

This paper studies the performance of unbuffered and buffered, packet-switching, multistage interconnection networks. We begin by reviewing the definition of banyan networks and introducing some generalizations of them. We then present an asymptotic analysis of the performance of unbuffered banyan networks, thereby solving a problem left open by Patel. We analyze the performance of the unbuffered generalized banyan networks, and compare networks with approximately equivalent hardware complexity. Finally, we analyze the performance of buffered banyan networks and again compare networks with approximately equivalent hardware complexity.

Original languageEnglish (US)
Pages (from-to)1091-1098
Number of pages8
JournalIEEE Transactions on Computers
VolumeC-32
Issue number12
DOIs
StatePublished - Dec 1983
Externally publishedYes

Keywords

  • Bandwidth
  • banyan network
  • bidelta network
  • buffered network
  • circuit-switching network
  • crossbar network
  • delta network
  • dilated network
  • multistage interconnection network
  • packet-switching network
  • performance analysis
  • replicated network
  • simulation
  • square network
  • throughput
  • unbuffered network
  • uniform network

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'The Performance of Multistage Interconnection Networks for Multiprocessors'. Together they form a unique fingerprint.

Cite this