The Community for Technology Leaders
Green Image
Issue No. 12 - December (1983 vol. 32)
ISSN: 0018-9340
pp: 1081-1090
L.N. Bhuyan , Department of Electrical and Computer Engineering, University of Southwestern Louisiana
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).
probability of acceptance, Bandwidth, cost factor, generalized shuffle, m-shuffle, mixed radix number system, multistage interconnection networks, network optimization, permutation and combination
L.N. Bhuyan, D.P. Agrawal, "Design and Performance of Generalized Interconnection Networks", IEEE Transactions on Computers, vol. 32, no. , pp. 1081-1090, December 1983, doi:10.1109/TC.1983.1676168
98 ms
(Ver 3.3 (11022016))