Abstract
This correspondence analyzes the permuting properties of a reconfigurable multicomputer architecture based on a regularrectangular SW-banyan interconnection network with arbitrary fan-out and an arbitrary number of stages. An analytical expression for the total number of distinct permutations performable by a rectangular SW-banyan (in one pass) is derived. It is shown how the combinatorial power of a rectangular SW-banyan increases with the growth of its fan-out. It is also shown that a two-pass (unidirectional) rectangular SW-banyan network can be made rearrangeable by a proper choice of the feedback connection.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 542-546 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Computers |
| Volume | C-34 |
| Issue number | 6 |
| DOIs | |
| State | Published - Jun 1985 |
Keywords
- Stirling approximation
- combinatorial power
- crossbar network
- graph isomorphism
- graph modeling
- multistage interconnection network
- permutation network
- rearrangeable network