On the rearrangeability of reverse shuffle/exchange networks
Conference
·
OSTI ID:98890
- Texas A&M Univ., College Station, TX (United States)
This paper proposes a new rearrangeable algorithm in a multistage reverse shuffle/exchange network. Currently, the best upper bound for the rearrangeability of a shuffle/exchange network in nonsymmetric networks is 3logN-3 stages. We describe the rearrangeability of reverse shuffle/exchange multistage interconnection network on every arbitrary permutation with N{le}16. It can be established by setting two more stages in the middle stage of the network to allow the reduced network to be topological equivalent to a class of rearrangeable networks. The results enable us to establish an upper bound, 2logN+1 stages for reverse shuffle/exchange network with N{le}16, and leads to the possibility of this bound when N>16.
- OSTI ID:
- 98890
- Report Number(s):
- CONF-940856--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Shuffle-exchange type interconnection networks for multiprocessor systems
Performing the shuffle with the PM2I and Illiac SIMD interconnection networks
A new interconnection network for SIMD computers: The sigma network
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:7162845
Performing the shuffle with the PM2I and Illiac SIMD interconnection networks
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5364277
A new interconnection network for SIMD computers: The sigma network
Journal Article
·
Wed Jul 01 00:00:00 EDT 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5768155