Equivalence of multistage interconnection networks
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Layered cross product—a technique to construct interconnection networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On a Class of Rearrangeable Networks
IEEE Transactions on Computers
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Topologies of Combined (2logN - 1)-Stage Interconnection Networks
IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Interval Routing on Layered Cross Product of Trees and Cycles
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A general approach to L(h,k)-label interconnection networks
Journal of Computer Science and Technology
A theory of decomposition into prime factors of layered interconnection networks
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper we study the topological equivalence problem of multistage interconnection networks (MINs). We prove a new characterization of topologically equivalent MINs by means of a novel approach. Applying this characterization to log N stage MINs we completely describe the equivalence class which the Reverse Baseline belongs to. Most important, we apply the characterization to (2 log N - 1) stage MINs obtained as concatenation of two log N stage Reverse Baseline equivalent MINs: in this way, we deduce an O(N log N) time algorithm testing the equivalence of two such MINs. This result substantially improves the time complexity of the previously known algorithms (O(N4 log N)). Finally, we determine the number of different equivalence classes of (2 log N - 1) stage MINs and we characterize each of them.