This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Functional and Topological Relations Among Banyan Multistage Networks of Differing Switch Sizes
February 1993 (vol. 4 no. 2)
pp. 235-240

Relations among banyan multistage interconnection networks (MINs) of differing switchsizes are studied. If two N*N networks W and W' have switch sizes r and s, respectively,and if r is greater than s, then W realizes a larger number of permutations than W'. Consequently, thetwo networks can never be equivalent. However, W may realize all the permutations ofW', in which case W is said to functionally cover W' in the strict sense. More generally, W is said to functionally cover W' in the wide sense if the terminals of W can be relabeled so that W realizes all the permutations of W'. Functional covering is topologically characterized, and an optimal algorithm to decide strict functional covering is developed.

[1] D. P. Agrawal, "Graph theoretical analysis and design of multistage Interconnection networks,"IEEE Trans. Comput., vol. C-32, pp. 636-648, July 1983.
[2] 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.
[3] D. P. Agrawal, S.-C Kim, and N. K. Swain, "Analysis and design of nonequivalent networks"IEEE Trans. Comput., vol. 37, pp. 233-237, Feb. 1988.
[4] T. Feng, "A survey of interconnection networks,"Comput. Mag., vol. 14, pp. 12-27, Dec. 1981.
[5] C. P. Kruskal and M. Snir, "A unified theory of interconnection network structure,"Theoret. comput. Sci., vol. 48, pp. 75-94, 1986.
[6] D. H. Lawrie, "Access and alignment of data in an arrary processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[7] A. Y. Oruc and M. Y. Oruc, "On testing isomorphism of permutation networks,"IEEE Trans. Comput., vol. C-34, pp. 958-962, Oct. 1985.
[8] M. C. Pease, "The indirect binary n-cube multiprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1976.
[9] H. J. Siegel and S. D. Smith, "Study of multistage SIMD interconnection networks," inProc. 5th Annu. Symp. Comput. Architecture, Apr. 1978, pp. 223-229.
[10] H. J. Siegel, "A model of SIMD machines and a comparison of various interconnection networks,"IEEE Trans. Comput., vol. C-28, no. 12, pp. 907-917, Dec. 1979.
[11] C. L. Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, no. 8, pp. 694-702, Aug. 1980.
[12] A. Youssef, "Properties of multistage interconnection networks," Ph.D. dissertation, Princeton Univ., Princeton, NJ, 1988.
[13] A. Youssef and B. Arden, "Equivalence between functionality and topology of log N-stage banyan networks,"IEEE Trans. Comput., vol. 39, no. 6, pp. 829-832, June 1990.

Index Terms:
Index Termsfunctional relations; topological relations; banyan multistage networks; switch sizes;multistage interconnection networks; MINs; optimal algorithm; multiprocessorinterconnection networks
Citation:
A. Youssef, B. Arden, "Functional and Topological Relations Among Banyan Multistage Networks of Differing Switch Sizes," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 2, pp. 235-240, Feb. 1993, doi:10.1109/71.207599
Usage of this product signifies your acceptance of the Terms of Use.