Design and Performance of Generalized Interconnection Networks

  • Authors:
  • L. N. Bhuyan;D. P. Agrawal

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Southwestern Louisiana;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1983

Quantified Score

Hi-index 14.99

Visualization

Abstract

This paper introduces a general class of self-routing interconnection networks for tightly coupled multiprocessor systems. The proposed network, named a "generalized shuffle network (GSN)," is based on a new interconnection pattern called a generalized shuffle and is capable of connecting any number of processors M to any number of memory modules N. The technique results in a variety of interconnection networks depending on how M nd N are factored. The network covers a broad spectrum of interconnections, starting from shared bus to crossbar switches and also includes various multistage interconnection networks (MIN's).