This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Composite Banyan Network
October 1995 (vol. 6 no. 10)
pp. 1043-1054

Abstract—A new multipath multistage interconnection network called the composite banyan network is proposed. The network incorporates both the banyan and the reverse banyan networks and is constructed by superimposing the two. The basic building blocks in the composite banyan network are 3 × 3 switching elements with log2N stages. A major advantage of the composite banyan network over existing networks with 3 × 3 SEs is an efficient and fast control algorithm that sets up a path between any source and destination pair. Instead of complex numerical calculations, the network can easily generate a primary routing tag and alternate tags through simple binary operations. Also, the network has a lot of favorable features, including regularity, symmetry, and easy rerouting capability under faults and conflicts. It is shown that at least two totally disjoint paths exist between any source and destination pair, which increase the degree of fault-tolerance. A deterministic permutation routing algorithm is also developed for the 8 × 8 composite banyan network. Using a simple tabular method, it is shown that the algorithm always finds a set of conflict-free tags.

[1] L. R. Goke and G. J. Lipovski,“Banyan networks for partitioning multiprocessor systems,”inFirst Ann. Symp. Comput. Archit., 1973, pp. 21–28.
[2] C.L. Wu and T. Feng,“On a class of multistage interconnection networks,” IEEE Trans. Computers, vol. 29, pp. 694-702, Aug. 1980.
[3] D.H. Lawrie,“Access and alignment of data in an array processor,” IEEE Trans. Computers, vol. 24, pp. 1,145-1,155, Dec. 1975.
[4] T. Feng,“Data manipulating functions in parallel processors and implementations,” IEEE Trans. Computers, vol. 23, pp. 309-318, Mar. 1974.
[5] K.E. Batcher,“The flip network in STARAN,” Proc. Int’l Conf. Parallel Processing, pp. 65-71, 1976.
[6] V. Benes,Mathematical Theory of Connecting Networks.New York: Academic Press, 1965.
[7] D.C. Opferman and N.T. Tsao-Wu,“On a class of rearrangeable switching networks,” Bell System Technical J., vol. 50, no. 5, pp. 1,579-1,600, May/June, 1971.
[8] G.B. Adams,D.P. Agarwal, and H.J. Siegel,"Fault-Tolerant Multistage Interconnection Networks," Computer, pp. 14-27, June 1987.
[9] G.B. Adams III and H.J. Siegel,“The extra stage cube: A fault tolerant interconnection network forsupersystems,” IEEE Trans. Computers, vol. 31, pp. 443-454, May 1982.
[10] N.-F. Tzeng, P.-C. Yew, and C.-Q. Zhu, “A Fault-Tolerant Scheme for Multistage Interconnection Networks,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 368-375, 1985.
[11] V.P. Kumar and S.M. Reddy,"Augmented Shuffle-Exchange Multistage Interconnection Networks," Computer, pp. 30-40, June 1987.
[12] K. Padmanabhan and D.H. Lawrie,“A class of redundant path multistage interconnection networks,” IEEE Trans. Computers., vol. 32, pp. 1,099-1,107, Dec. 1983.
[13] R.J. McMillen and H.J. Siegel,“Routing schemes for augmented data manipulator network in an MIMD system,” IEEE Trans. Computers, vol. 31, pp. 1,202-1,214, Dec. 1982.
[14] D.S. Parker and C.S. Raghavendra,“The gamma network,” IEEE Trans. Computers, vol. 33, pp. 367-373, Apr. 1984
[15] C.S. Raghavendra and A. Varma,“Fault-tolerant multiprocessors with redundant-path interconnection networks,” IEEE Trans. Computers, vol. 35, No. 4, Apr. 1986.
[16] A. Varma and C.S. Raghavendra,“On permutations passable by the gamma network,” J. Parallel and Distributed Computing, vol. 3, pp. 72-91, 1986.
[17] C.P. Kruskal and M. Snir,“The performance of multistage interconnection networks for multiprocessors,” IEEE Trans. Computers, vol. 32, pp. 1,091-1,098, Dec. 1983.

Index Terms:
Interconnection networks, composite banyan network, topology-describing functions, primary and alternate routing tags, binary weights, permutation routing algorithm.
Citation:
Seung-Woo Seo, Tse-Yun Feng, "The Composite Banyan Network," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 10, pp. 1043-1054, Oct. 1995, doi:10.1109/71.473514
Usage of this product signifies your acceptance of the Terms of Use.