A reconfigurable multicomputer architecture based on a rectangular CC-banyan multistage interconnection network is presented. A graph-theoretical approach is used to study this network's permuting and structural 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 authors derive the analytical expressions for the number of permutations in CC-banyans with fanouts two and three.
|Original language||English (US)|
|Title of host publication||Proceedings of the International Conference on Parallel Processing|
|Editors||Kai Hwang, Steven M. Jacobs, Earl E. Swartzlander|
|Number of pages||4|
|State||Published - Dec 1 1986|