Parallel computing: theory and comparisons
Parallel computing: theory and comparisons
Resource allocation in rectangular CC-banyans
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Resource allocation in rectangular SW banyans
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
| Hi-index | 14.98 |
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.