On the university of multipath multistage interconnection networks
- Columbia Univ., New York, NY (USA). Dept. of Electrical Engineering
- Toronto Univ., ON (Canada). Dept. of Electrical Engineering
An analytic approximation for the blocking probability of a circuit-switched multipath multistage interconnection network when it is required to perform arbitrary permutations under local control is presented. An analytic approximation for the expected number of conflict-free permutations realizable by a network in one pass under local control is also presented. In addition, an analytic approximation for the expected number of passes through a network required to realize an arbitrary permutation under local control is presented. These models give a quantitative measure of a network's ability to perform arbitrary permutations and of the inherent blocking in a network. These models are used to analyze two variations of banyan networks that have been discussed in the literature: dilated and augmented banyan networks. It is shown that these networks can be designed with very low blocking probabilities under permutation request patterns, and that they can be designed to realize almost all permutations in one pass under local control.
- OSTI ID:
- 6913248
- Journal Information:
- Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 7:3; ISSN JPDCE; ISSN 0743-7315
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multistage interconnection networks with multiple outlets
Resource allocation in multistage interconnection network-based systems