论文信息 - The PN2I network: A scalable Banyan network

The PN2I network: A scalable Banyan network

To design a Banyan network with an arbitrary even-sized port number, the PN2I network is proposed. The PN2I network can be divided into two classes: the complete and incomplete versions. A simple routing algorithm is given, but in the incomplete PN2I networks, this routing algorithm fails to make the traffic in links even, which deteriorates the performance badly. Thus a new routing algorithm is proposed, which makes the incomplete PN2I networks behave almost the same as the PN2I networks with respect to the performance issues.

Zengji Liu | Zhiliang Qiu | Zhen Chen | Xiaoming Tao

[1] Cauligi S. Raghavendra,et al. The Gamma Network , 1984, IEEE Transactions on Computers.

[2] Dharma P. Agrawal,et al. Graph Theoretical Analysis and Design of Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[3] C. Y. Roger Chen,et al. Performance analysis of single-buffered multistage interconnection networks , 1994, IEEE Trans. Commun..

[4] Mischa Schwartz,et al. Broadband integrated networks , 1996 .

[5] Dharma P. Agrawal,et al. Design and Performance of Generalized Interconnection Networks , 1983, IEEE Transactions on Computers.

[6] Hee Yong Youn,et al. Performance analysis of finite buffered multistage interconnection networks , 1992, Proceedings Supercomputing '92.

[7] Krishnan Padmanabhan,et al. Design and Analysis of Even-Sized Binary Shuffle-Exchange Networks for Multiprocessors , 1991, IEEE Trans. Parallel Distributed Syst..