Interconnection Networks in Multiple-Processor Systems.
Abstract
The class of multistage interconnection networks with the configuration is introduced as a reverse-exchange interconnection network which is shown to be a powerful interconnection network for the parallel processing system. A recursive formula is derived to calculate the control pattern of the network for each of four realizable permutation classes. The recursive formulas can provide superior operating speed over the existing routing algorithms. It is proven that all permutations can be realized by the reverse-exchange network in two passes. Both the construction and routing algorithms are provided. Our results compares favorably with those of other networks. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1979
- Accession Number
- ADA080959
Entities
People
- Chuan-lin Wu
- Tse-yun Feng
Organizations
- Wayne State University