Abstract
This paper introduces a new high-level net, named S-net, for modelling multistage interconnection networks. Based on the stochastic behaviour of GSPN and coupled with the flexibility and compactness of Coloured Petri net uses tokens for storage and manipulation of data besides modelling the flow of control. It requires exactly 3N/2 number of places to model an N×N multistage interconnection network irrespective of the number of stages and buddy properties of the network. A polynomial time algorithm is developed to check feasibility of mapping a permutation using the proposed S-net model of an MIN.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
