Partitioning and permuting properties of CC-banyan networks
Vladimir Cherkassky, Miroslaw Malek · IEEE Transactions on Computers · 1989
A multicomputer network, called rectangular CC-banyan, is presented and formally defined. A graph-theoretic approach is used to study this network's permuting and partitioning properties. It is shown that a CC-banyan has a modular structure and hence can be recursively defined. A method for evaluation of the total number of permutations in CC-banyans is presented. Using this method, the analytical expressions for the number of permutations in CC-banyans with fan-outs of two and three are derived.>