Permutation capability of optical multistage interconnection networks: 72
Journal of Parallel and Distributed Computing
Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
An Optimal Algorithm for Permutation Admissibility to Multistage Interconnection Networks
IEEE Transactions on Computers
An Optimal O(NlgN) Algorithm for Permutation Admissibility to Extra-Stage Cube-Type Networks
IEEE Transactions on Computers
Permutation routing in optical MIN with minimum number of stages
Journal of Systems Architecture: the EUROMICRO Journal
Blocking behaviors of crosstalk-free optical Banyan networks on vertical stacking
IEEE/ACM Transactions on Networking (TON)
Optical solutions for system-level interconnect
Proceedings of the 2004 international workshop on System level interconnect prediction
A Novel Multistage Network Architecture with Multicast and Broadcast Capability
The Journal of Supercomputing
The modified fuzzy art and a two-stage clustering approach to cell design
Information Sciences: an International Journal
New insights on survivability in multi-domain optical networks
Information Sciences: an International Journal
Soundness-preserving reduction rules for reset workflow nets
Information Sciences: an International Journal
Modeling and monitoring of E-commerce workflows
Information Sciences: an International Journal
Exploiting colored Petri nets to decide on permutation admissibility
Acta Informatica
Analyzing permutation capability of multistage interconnection networks with colored Petri nets
Information Sciences: an International Journal
Optical multistage interconnection networks: new challenges and approaches
IEEE Communications Magazine
Hi-index | 0.07 |
Although optical multistage interconnection networks (OMINs) promise to meet the ever growing demands of communication networks and multiprocessor systems in fast communication, they suffer from challenges such as path dependent loss and switch crosstalk. In this paper, we propose an innovative approach for reducing not only the path dependent loss but also the number of switch crosstalks in OMINs. Our approach is centered upon modelling OMINs with Petri nets and using the P-invariants method to determine the minimum number of stages m"m"i"n that is sufficient to establish requested communication patterns in variable-stage OMINs. Being composed of the smallest number of stages and consequently directional couplers (or photonic switches), m"m"i"n-stage OMIN employs minimal structure and, therefore, path dependent loss and also number of switch crosstalks reach the least possible values in the realization of requested communication patterns. We prove that the size of Petri nets created in this work is in polynomial dependence on the problem size which alleviates memory consumption significantly and ascertains the fact that memory capacity and performance of modern computers are indeed sufficient to run our task. We also show that the complexity results obtained in this research improve similar results reported in our previous paper. We carry out a series of computer experiments to confirm the effectiveness of the proposed approach.