Abstract
A Benes permutation network capable of setting its own switches dynamically is presented. The total switch setting and delay time for the N input/output self-routing network is O(log N). It is shown that the network is capable of performing a rich class of permutations. The self-routing scheme leads to efficient O(log N) parallel algorithms to perform the same class of permutations on cube connected and perfect shuffle computers.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 332-340 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Computers |
| Volume | C-30 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 1981 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics
Keywords
- Benes network
- bit-permute-complement permutations
- complexity
- cube connected computer
- inverse omega permutations
- omega permutations
- perfect shuffle computer