Issue No. 07 - July (1987 vol. 36)
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.
performance analysis, Banyan networks, crossbar networks, multistage interconnection networks
V. Hamacher and T. Szymanski, "On the Permutation Capability of Multistage Interconnection Networks," in IEEE Transactions on Computers, vol. 36, no. , pp. 810-822, 1987.