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
Topologies of Combined (2logN - 1)-Stage Interconnection Networks
IEEE Transactions on Computers
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Permutation capability of optical multistage interconnection networks: 72
Journal of Parallel and Distributed Computing
O(n) routing in rearrangeable networks
Journal of Systems Architecture: the EUROMICRO Journal
Classification Categories and Historical Development of Circuit Switching Topologies
ACM Computing Surveys (CSUR)
A Three-Stage One-Sided Rearrangeable Polygonal Switching Network
IEEE Transactions on Computers
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Rearrangeable Three-Stage Interconnection Networks and Their Routing Properties
IEEE Transactions on Computers
On the Rearrangeability of Multistage Networks Employing Uniform Connection Patterns
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
IEEE Transactions on Computers
More on rearrangeability of combined (2n - 1)-stage networks
Journal of Systems Architecture: the EUROMICRO Journal
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Modeling and monitoring of E-commerce workflows
Information Sciences: an International Journal
Information Sciences: an International Journal
On path dependent loss and switch crosstalk reduction in optical networks
Information Sciences: an International Journal
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
| Hi-index | 0.07 |
In a multistage interconnection network (MIN) the calculation of the number of permutations of the input terminals into the output terminals is a classic difficult problem. In this paper, we introduce an innovative technique based on Colored Petri Nets (known as CP-nets or CPNs) that will allow us to analyze the permutation capability of arbitrary MINs. We show how to verify whether a MIN is rearrangeable through the state space analysis of the associated CP-net and we measure the permutation capability of non-rearrangeable MINs in terms of the permutations that can be generated. The proposed approach takes advantage of powerful existing software tools, particularly, CPNTools, which is used to explore the occurrence graphs of CP-nets and determine the set of permutations performed by the modeled MINs. This new technique is easy to use and can be efficiently applied to MINs made of cross-bar switches.