Universal multistage networks via linear permutations

No abstract available

[1]  H. Cam,et al.  Rearrangeability of shuffle-exchange networks , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[2]  Charles M. Fiduccia,et al.  Universality of iterated networks , 1992, SPAA '92.

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[5]  Marshall Hall,et al.  Combinatorial Theory, 2nd Edition , 1967 .

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[8]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[9]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[10]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[11]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[12]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

[13]  Kenneth E. Batcher,et al.  The flip network in staran , 1976 .

[14]  W. Greub.  Linear Algebra , 1981 .

[15]  František Soviš.  On rearrangeable networks of the shuffle-exchange type , 1988 .