IEEE Transactions on Computers · 1983 · 125 citations · 19 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureInterconnection NetworksParallel ComputingCrossbar NetworksInterconnect DesignMultiprocessor SystemsMultistage Interconnection NetworksParallel ArchitecturesRoutingInterconnect Network DesignInterconnect TopologiesInterconnection Network Topology DesignMemory InterconnectsMultistage Switching NetworksParallel Computing InterconnectsSelf-routingShuffle
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).
19
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations