This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Equivalence Between Functionality and Topology of Log N-Stage Banyan Networks
June 1990 (vol. 39 no. 6)
pp. 829-832

Existing procedures to decide network equivalence in log N-stage banyan networks are based on analysis of permutations, take polynomial but costly time, and do not shed light on or take advantage of the relationship between functionality and topology. This relationship is addressed and it is shown that two log N-stage banyan networks of the same switch size are functionally equivalent if and only if they have the same underlying topology. An O(N log N) algorithm is derived which decides if two N-stage banyan networks of N inputs, N outputs, and r*r crossbar switches as building blocks realize the same permutations. The algorithm works by comparing the underlying topologies of the two networks. The algorithm is optimal because the size of the networks is O(N log N).

[1] D. P. Agrawal and J.-S. Leu, "Dynamic accessibility testing and path length optimization of multistage interconnection networks,"IEEE Trans. Comput., vol. C-34, pp. 255-266, Mar. 1985.
[2] D. P. Agrawal, "Graph theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C-32, pp. 636-648, July 1983.
[3] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[4] J. B. Attili, "On the construction of conjugation maps for functionally equivalent interconnection networks," M.Eng. thesis, RPI, Sept. 1984.
[5] L. N. Bhuyan and D. P. Agrawal, "Design and performance of generalized interconnection networks,"IEEE Trans. Comput., pp. 1081-1090, Dec. 1983.
[6] V. Cherkassky and M. Malek, "On permuting properties of regular rectangular SW-banyans,"IEEE Trans. Comput., vol. C-34, pp. 542-546, June 1985.
[7] T. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, pp. 12-27, Dec. 1981.
[8] D. K. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[9] G. F. Lev, N. Pippenger, and L. G. Valiant, "A fast parallel algorithm for routing in permutation networks,"IEEE Trans. Comput., vol. C- 30, pp. 93-100, Feb. 1981.
[10] W. Lin, "An automorphism of a class of interconnection networks," inProc. 1986 Int. Conf. Parallel Processing, pp. 1-3.
[11] A. Y. Oruc and M. Y. Oruc, "On testing permutation network isomorphisms," inProc. 1985 Int. Conf. Parallel Processing, pp. 361-368.
[12] A. Y. Oruc and M. Y. Oruc, "Equivalence relations among interconnection networks,"J. Parallel Distributed Comput., vol. 2, pp. 30-49, 1985.
[13] A. Y. Oruc and M. Y. Oruc, "On testing isomorphism of permutation networks,"IEEE Trans. Comput., vol. C-34, pp. 958-962, Oct. 1985.
[14] A. Y. Oruc, M. Y. Oruc, and N. Balabanian, "Reconfiguration algorithms for interconnection networks,"IEEE Trans. Comput., vol. C-34, pp. 773-776, Aug. 1985.
[15] M. C. Pease, "The indirect binaryn-cube multiprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1976.
[16] H. J. Siegel, "A model of SIMD machines and a comparison of various interconnection networks,"IEEE Trans. Comput., vol. C-28, pp. 907-917, Dec. 1979.
[17] H. J. Siegel and S. D. Smith, "Study of multistage SIMD interconnection networks," inProc. 5th Annu. Symp. Comput. Architecture, Apr. 1978, pp. 223-229.
[18] M. A. Sridhar, "A fast algorithm for testing isomorphism of permutation networks,"IEEE Trans. Comput., vol. 38, pp. 903-909, June 1989.
[19] T. H. Szymanski and V. C. Hamacher, "On the permutation capability of multistage interconnection networks,"IEEE Trans. Comput., vol. C-36, pp. 810-822, July 1987.
[20] C. Wu and T. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.
[21] C. Wu and T. Feng, "The reverse-exchange interconnection network,"IEEE Trans. Comput., vol. C-29, pp. 801-811, Sept. 1980.
[22] A. Youssef, "Properties of multistage interconnection networks," Ph.D. dissertation, Princeton Univ., Princeton, NJ, 1988.

Index Terms:
functionality; topology; log N-stage banyan networks; network equivalence; permutations; multiprocessor interconnection networks.
Citation:
A. Youssef, B.W. Arden, "Equivalence Between Functionality and Topology of Log N-Stage Banyan Networks," IEEE Transactions on Computers, vol. 39, no. 6, pp. 829-832, June 1990, doi:10.1109/12.53604
Usage of this product signifies your acceptance of the Terms of Use.