DocumentCode
1147761
Title
Design and Performance of Generalized Interconnection Networks
Author
Bhuyan, Laxmi N. ; Agrawal, Dharma P.
Author_Institution
Department of Electrical and Computer Engineering, University of Southwestern Louisiana
Issue
12
fYear
1983
Firstpage
1081
Lastpage
1090
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).
Keywords
Bandwidth; cost factor; generalized shuffle; m-shuffle; mixed radix number system; multistage interconnection networks; network optimization; permutation and combination; probability of acceptance; Bandwidth; Cost function; Helium; Interference; Joining processes; Multiprocessing systems; Multiprocessor interconnection networks; Parallel processing; Performance analysis; Switches; Bandwidth; cost factor; generalized shuffle; m-shuffle; mixed radix number system; multistage interconnection networks; network optimization; permutation and combination; probability of acceptance;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1983.1676168
Filename
1676168
Link To Document