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, we derive the analytical expressions for the number of permutations in CC-banyans with fanouts two and three.
Bibliographical noteFunding Information:
Manuscript received August 1, 1984; revised October 30, 1987. This work was supported in part by the Graduate School at the University of Minnesota, IBM Corporation and the Office of Naval Research under Grant N0014-86-K- 0554. V. Cherkassky is with the Department of Electrical Engineering, University of Minnesota, Minneapolis, MN 55455. M. Malek is with the Department of Electrical and Computer Engineering, University of Texas, Austin, TX 78712. IEEE Log Number 8718955.
- graph modeling
- multistage interconnection network
- nonequivalent network
- recursive network