论文信息 - Regular CC-banyan networks

Regular CC-banyan networks

Construction algorithms for rectangular and nonrectangular CC-Banyan networks are presented. Routing algorithms for double and single-ended rectangular and non-rectangular CC-Banyan networks are also presented. The time complexities of the routing algorithms are O(l), where l is the number of stages in the network.

G. Jack Lipovski | Roy M. Jenevein | Alfred C. Hartmann | Doug W. Kim

[1] G. Jack Lipovski,et al. Parallel computing - theory and comparisons , 1987 .

[2] Gregory F. Pfister,et al. “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[3] G. Jack Lipovski,et al. An algorithmic approach to the simulation modeling and performance evaluation of banyan networks , 1988 .

[4] Pin-Yee Chen. Multiprocessor systems: interconnection networks, memory hierarchy, modeling and simulations , 1982 .

[5] Miroslaw Malek,et al. Analysis of CC-Banyan Networks , 1986, ICPP.

[6] Marc Snir,et al. The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.