DocumentCode :
1142979
Title :
The Theory Underlying the Partitioning of Permutation Networks
Author :
Siegel, Howard Jay
Author_Institution :
School of Electrical Engineering, Purdue University
Issue :
9
fYear :
1980
Firstpage :
791
Lastpage :
801
Abstract :
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.
Keywords :
Cube network; Illiac; PM21 network; SIMD machines; Shuffle-Exchange network; interconnection networks; multiple-SIMD (MSIMD) machines; parallel processing; partitionable computer systems; permutation networks; Broadcasting; Computer networks; Concurrent computing; Large-scale systems; Microcomputers; Microprocessors; Multiprocessing systems; Multiprocessor interconnection networks; Parallel processing; US Government; Cube network; Illiac; PM21 network; SIMD machines; Shuffle-Exchange network; interconnection networks; multiple-SIMD (MSIMD) machines; parallel processing; partitionable computer systems; permutation networks;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1980.1675678
Filename :
1675678
Link To Document :
بازگشت