Performance analysis of multistage interconnection networks with a new high-level net model
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 NN 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.
mins colour net time-based nets data place control place