论文信息 - On Computing the Combinatorial Power of SW-Banyan Networks

On Computing the Combinatorial Power of SW-Banyan Networks

The problem of calculating the combinatorial power of certain SW-banyan networks is related to a problem of enumerating certain matrices. Examples of two- and three-stage networks are used to demonstrate the technique. In each case, a polynomial-time algorithm is found to solve the problem. The results are presented for each case and certain asymptotic behavior is noted. >

S. C. Kothari | R. S. Roberts

[1] Miroslaw Malek,et al. On Permuting Properties of Regular Rectangular SW-Banyans , 1985, IEEE Transactions on Computers.

[2] Howard Jay Siegel,et al. On the Number of Permutations Performable by the Augmented Data Manipulator Network , 1982, IEEE Transactions on Computers.

[3] Doug DeGroot,et al. Expanding and Contracting SW-Banyan Networks , 1983, ICPP.

[4] Harold Neville Vazeille Temperley,et al. Graph theory and applications , 1981 .

[5] John Paul Shen. Fault tolerance analysis of several interconnection networks , 1982, ICPP.

[6] R. Brualdi. Matrices of zeros and ones with fixed row and column sum vectors , 1980 .

[7] Mary Diane Palmer Leland. On the Power of the Augmented Data Manipulator Network , 1985, ICPP.