This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Permutation Capability of Multistage Interconnection Networks
July 1987 (vol. 36 no. 7)
pp. 810-822
T.H. Szymanski, Departments of Electrical Engineering and Computer Science and the Computer Systems Research Institute, University of Toronto
We present analytic models for the blocking probability of both unique path and multiple path multistage interconnection networks under the assumption of either permutation or random memory request patterns. The blocking probability of an interconnection network under the assumption of permutation requests is a quantitative measure of the network's permutation capability. We compare the performance of networks with approximately equivalent hardware complexity. It is shown that variations of banyan networks can be designed with extremely low blocking probabilities under the assumption of permutation requests.
Index Terms:
performance analysis, Banyan networks, crossbar networks, multistage interconnection networks
Citation:
T.H. Szymanski, V.C. Hamacher, "On the Permutation Capability of Multistage Interconnection Networks," IEEE Transactions on Computers, vol. 36, no. 7, pp. 810-822, July 1987, doi:10.1109/TC.1987.1676978
Usage of this product signifies your acceptance of the Terms of Use.