Efficient algorithms for checking the equivalence of multistage interconnection networks

Journal of Parallel and Distributed Computing

Volumn 64, Issue 1, 2004, Pages 135-150

  Calamoneri, Tiziana ^a   Massini, Annalisa ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Layered cross product; Layered graphs; Multistage interconnection networks; Topological equivalence

Indexed keywords

EID: 1642420417     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.09.003     Document Type: Article

References (24)

1. D.P. Agrawal, Graph theoretical analysis and design of multistage interconnection networks, IEEE Trans. Comput. C32 (1983) 637-648.
2. K.E. Batcher, The flip network in STARAN, Proceedings of the International Conference on Parallel Processing, 1981, pp. 65-71.
3. V.E. Beneš, On rearrangeable three-stage connecting networks, Bell System Tech. J. XLI (1962) 1481-1492.
4. J.C. Bermond, J.M. Fourneau, A. Jean-Marie, Equivalence of multistage interconnection networks, Inform. Process. Lett. 26 (1987) 45-50.
5. T. Calamoneri, M. Di Ianni, Interval routing & layered cross product: compact routing schemes for butterfly, mesh of trees, fat trees and Beneš networks, J. Parallel Distrib. Comput. (2003) in press; A preliminary version appeared in Proceedings of the Fourth International Euro-Par Conference, Lecture Notes in Computer Science, Vol. 1470, Springer, Berlin, 2001, pp. 1029-1039.
6. T. Calamoneri, A. Massini, A new approach to the rearrangeability of (2 log N - 1) stage MINs, Proceedings of IASTED International Symposium on Applied Informatics (AI 2001), Innsbruck, 2001, pp. 365-370.
7. G.A. De Biase, Interconnection structures and parallel computing, in: D.J. Evans (Ed.), Advances in Parallel Computing, JAI Press, Vol. 1, 1991.
8. J. Duato S, Yalamanchili, L. Ni, Interconnection Networks: An Engineering Approach, IEEE Computer Society, Silver Spring, MD, 1997.
9. G. Even, S. Even, Embedding interconnection networks in grid via the layered cross product, Networks 36 (2) (2000) 91-95.
10. S. Even, A. Litman, Layered cross product - a technique to construct interconnection networks, Fourth ACM Symposium on Parallel Algorithms and Architectures (SPAA'92), San Diego, CA, 1992, pp. 60-69.
11. T. Feng. Data manipulating functions in parallel processors and their implementations, IEEE Trans. Comput. C23 (1974) 309-318.
12. T. Feng, Y. Kim, S. Seo, Interstage correlation in a class of multistage interconnection networks, Proceedings of the 1994 International Computer Symposium, 1994.
13. M.R. Garey, D.S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco, 1979.
14. Q. Hu, X. Shen, J. Yang, Topologies of combined (2 log N - 1)-stage interconnection networks, IEEE Trans. Comput. 46 (1997) 118-124.
15. J. Köbler, U. Schöning, J. Torán, The Graph Isomorphism Problem. Its Structural Complexity, Birkhauser Boston Inc., Boston, MA, 1993.
16. R. Kráľovič, B. Rovan, P. Ružička, Interval routing on layered cross product of trees and cycles, Proceedings of the Fifth International Euro-Par Conference, Lecture Notes in Computer Science, Vol. 1685, Springer, Berlin, 1999.
17. D. H. Lawrie, Access and alignment of data in an array processor, IEEE Trans. Computers C24 (1975) 1145-1155.
18. K.Y. Lee, On the rearrangeability of 2 log N - 1-stage permutation networks, IEEE Trans. Comput. C34 (1985) 412-425.
19. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes, Morgan Kaufmann Publications, San Mateo, CA, 1992.
20. A. Paz, A theory of decomposition into prime factors of layered interconnection networks, manuscript, 2001. A preliminary version of this paper was presented at the Dagstuhl Seminar on Graphs Transformations in Computer Science, September 1996.
21. M.C. Pease, The indirect binary cube microprocessor array, IEEE Trans. Comput. C26 (1977) 458-473.
22. C. Wu, T. Feng, On a class of multistage interconnection networks, IEEE Trans. Comput. C29 (1980) 694-702.
23. C. Wu, T. Feng, The reverse-exchange interconnection networks, IEEE Trans. Comput. C29 (1980) 801-811.
24. Y. Yeh, T. Feng, On a class of rearrangeable networks, IEEE Trans. Comput. C41 (1992) 1361-1379.