Analyzing permutation capability of multistage interconnection networks with colored Petri nets
From MaRDI portal
Publication:2509234
DOI10.1016/j.ins.2005.12.012zbMath1110.68004OpenAlexW2085133807MaRDI QIDQ2509234
Valentino Crespi, Rza Bashirov
Publication date: 19 October 2006
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2005.12.012
Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ Exploiting colored Petri nets to decide on permutation admissibility ⋮ Modeling and monitoring of E-commerce workflows
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The practitioner's guide to coloured Petri nets.
- Permutation capability of optical multistage interconnection networks
- Rearrangeability of \((2\log_n N-1)\)-stage networks employing a uniform connection pattern
- Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8
- Rearrangeability of multistage shuffle/exchange networks
- On a Class of Multistage Interconnection Networks
- Parallel Algorithms to Set Up the Benes Permutation Network
- Access and Alignment of Data in an Array Processor
This page was built for publication: Analyzing permutation capability of multistage interconnection networks with colored Petri nets