This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Theory Underlying the Partitioning of Permutation Networks
September 1980 (vol. 29 no. 9)
pp. 791-801
H.J. Siegel, School of Electrical Engineering, Purdue University
The age of the microcomputer has made feasible large-scale multiprocessor systems. In order to use this parallel processing power in the form of a flexible multiple-SIMD (MSIMD) system, the interconnection network must be partitionable and dynamically reconfigurable. The theory underlying the partitioning of MSIMD system permutation networks into independent subnetworks is explored. Conditions for determining if a network can be partitioned into independent subnetworks and the ways in which it can be partitioned are presented. The use of the theory is demonstrated by applying it to the Cube, Illiac, PM2I, and Shuffle-Exchange SIMD machine interconnection networks. Both recirculating (single stage) and multistage network implementations are considered.
Index Terms:
SIMD machines, Cube network, Illiac, interconnection networks, multiple-SIMD (MSIMD) machines, parallel processing, partitionable computer systems, permutation networks, PM21 network, Shuffle-Exchange network
Citation:
H.J. Siegel, "The Theory Underlying the Partitioning of Permutation Networks," IEEE Transactions on Computers, vol. 29, no. 9, pp. 791-801, Sept. 1980, doi:10.1109/TC.1980.1675678
Usage of this product signifies your acceptance of the Terms of Use.