Merging and Sorting Networks with the Topology of the Omega Network
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On a Class of Rearrangeable Networks
IEEE Transactions on Computers
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Efficient algorithms for checking the equivalence of multistage interconnection networks
Journal of Parallel and Distributed Computing
More on rearrangeability of combined (2n - 1)-stage networks
Journal of Systems Architecture: the EUROMICRO Journal
Rearrangeability of bit permutation networks
Theoretical Computer Science
A theory of decomposition into prime factors of layered interconnection networks
Discrete Applied Mathematics
Analyzing permutation capability of multistage interconnection networks with colored Petri nets
Information Sciences: an International Journal
| Hi-index | 14.98 |
A combined (2logN 驴 1)-stage interconnection network (denoted by $\Delta \oplus \Delta '$) is constructed by concatenating two Omega-equivalent networks (驴 and 驴驴) with the rightmost stage of 驴 and the leftmost stage of 驴驴 overlapped. Benes network and the (2logN 驴 1)-stage shuffle-exchange network are two examples of such networks. Although these two networks have received intensive studies, the research on the topology of entire class of $\Delta \oplus \Delta '$ networks is very limited so far. In this paper, we study the topological structure of $\Delta \oplus \Delta '$ networks and propose an algorithm for determining topological equivalence between two given $\Delta \oplus \Delta '$ networks. We also present a simplified 驴-equivalence checking algorithm as a supporting result.