Analyzing permutation capability of multistage interconnection networks with colored Petri nets

Information Sciences

Volumn 176, Issue 21, 2006, Pages 3143-3165

  Bashirov, Rza ^a   Crespi, Valentino ^b  

^a EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Colored Petri net; CPNTools; Multistage interconnection network; Permutation capability

Indexed keywords

COMPUTER GRAPHICS; COMPUTER NETWORKS; NUMERICAL METHODS; PERFORMANCE; STATE SPACE METHODS; SWITCHES;

COLORED PETRI NET; CPNTOOLS; MULTISTAGE INTERCONNECTION NETWORK; PERMUTATION CAPABILITY;

PETRI NETS;

EID: 33746686280     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.12.012     Document Type: Article

References (28)

1. Bashirov R. On the rearrangeability of (2s - 1)-stage nonsymmetric interconnection networks. Proceedings of the International Conference on Parallel and Distributed Computing Techniques and Applications (2000), CSREA Press, Las Vegas, NV 907-910
2. Bashirov R. On the rearrangeability of multistage interconnection networks employing uniform connection pattern. Lecture Notes in Computer Science 1909 (2000) 170-180
3. 2 N - 1)-stage networks employing uniform connection pattern. Calcolo 38 (2001) 85-95
4. Beneš V. Mathematical Theory of Connecting Networks and Telephone Traffic (1965), Academic Press, New York
5. Broomel G., and Heath J.R. Classification categories and historical development of circuit switching topologies. ACM Computing Surveys 15 (1983) 95-133
6. Das N. More on rearrangeability of combined (2n - 1)-stage networks. Journal of Systems Architecture 51 (2005) 207-222
7. Das N., Mikhopadhyaya K., and Dattagupta J. O(n) routing in rearrangeable networks. Journal of Systems Architecture 46 (2000) 529-542
8. Douglass B.G. Rearrangeable three-stage interconnection networks and their routing properties. IEEE Transactions on Computers 42 (1993) 559-567
9. L. Goke, G. Lipovski, Banyan networks for partitioning multiprocessor systems, in: Proc. 1st Annual Symposium on Computer Architecture, Miami, FL, 1973, pp. 21-28.
10. Hu Q., Shen X., and Yang J. Topologies of combined (2log N - 1)-stage interconnection networks. IEEE Transactions on Computers 46 (1997) 118-124
11. Jensen K. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use vol. 1 (1997), Springer Verlag, Berlin
12. Jensen K. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use vol. 2 (1997), Springer Verlag, Berlin
13. Jensen K., Christensen S., and Kristensen M. CPNTools: Occurrence Graph Manual (2002), University of Aarhus, Åarhus, Denmark
14. Kannan R. The KB-Benes network: a control-optimal rearrangeable permutation network. IEEE Transactions on Computers 54 (2005) 534-544
15. Kristensen L.M., Christensen S., and Jensen K. The practitioners guide to colored Petri nets. International Journal for Software Tools and Technology Transfer 2 (1998) 98-132
16. Lakshmivarahan S., and Dhall S.K. Analysis and Design of Parallel Algorithms (1990), McGraw-Hill, Singapore
17. Lawrie D.H. Access and alignment data in an array processor. IEEE Transactions on Computers 24 (1975) 1145-1155
18. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann Publishers, San Mateo, CA
19. Nassimi D., and Sahni S. Parallel algorithms to set up the Beneš permutation network. IEEE Transactions on Computers 31 (1982) 148-154
20. Raghavendra C.S., and Varma A. Rearrangeability of the 5-stage shuffle-exchange network for N = 8. IEEE Transactions on Communications 35 (1987) 808-812
21. J. Sengupta, P.K. Bansal, A. Gupta, Permutation and reliability measures of regular and irregular MINs, in: Proceedings of the Trends in Electronics Conference, Kuala Lumpur, vol. 1, 2000, pp. 531-536.
22. Varma A., and Raghavendra C.S. Rearrangeability of multistage shuffle-exchange networks. IEEE Transactions on Communications 36 (1988) 1138-1143
23. Varma A., and Raghavendra C.S. Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice (1994), IEEE Computer Society Press, Los Alamitos, CA
24. G. Veselovsky, D.A. Batovski, A study of the permutation capability of a binary hypercube under deterministic routing, in: Proc. 11th European Conference on Distributed and Network-Based Processing, Genova, 2003, pp. 173-177.
25. Wu C., and Feng T. On a class of multistage interconnection networks. IEEE Transactions on Computers 29 (1980) 694-702
26. Yang Y., Wang J., and Pan Y. Permutation capability of optical multistage interconnection networks. Journal of Parallel and Distributed Computing 60 (2000) 72-91
27. Yeh Y., and Feng T. On a class of rearrangeable networks. IEEE Transactions on Computers 41 (1992) 1361-1379
28. Yen M.H., and Chen S.J. A three-stage and one-sided rearrangeable polygonal switching network. IEEE Transactions on Computers 50 (2001) 1291-1294