DocumentCode
1014675
Title
Partitioning and permuting properties of CC-banyan networks
Author
Cherkassky, Vladimir ; Malek, Miroslaw
Author_Institution
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
Volume
38
Issue
2
fYear
1989
Firstpage
274
Lastpage
278
Abstract
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.<>
Keywords
graph theory; multiprocessor interconnection networks; CC-banyan networks; graph-theoretic approach; modular structure; multicomputer network; partitioning; permuting properties; Application software; Computer network reliability; Computer networks; Large scale integration; Multiprocessor interconnection networks; Switches; Very large scale integration;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.16504
Filename
16504
Link To Document