A new interconnection network for SIMD computers: the sigma networks
IEEE Transactions on Computers
A New Benes Network Control Algorithm
IEEE Transactions on Computers
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Pipelined Single-Bit Controlled Sorting Network with O(N log^2 N) Bit Complexity
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Fault Tolerant Interleaved Switching Fabrics For Scalable High-Performance Routers
IEEE Transactions on Parallel and Distributed Systems
Permuting streaming data using RAMs
Journal of the ACM (JACM)
On rearrangeability of tandem connection of banyan-type networks
IEEE Transactions on Communications
Automatic generation of streaming datapaths for arbitrary fixed permutations
Proceedings of the Conference on Design, Automation and Test in Europe
Dynamically reconfigurable dataflow architecture for high-performance digital signal processing
Journal of Systems Architecture: the EUROMICRO Journal
A theory of decomposition into prime factors of layered interconnection networks
Discrete Applied Mathematics
| Hi-index | 14.99 |
For any parallel computer systems which consist of many processing elements and memories, interconnection networks provide communication paths among processing elements and memories. Both the rearrangeability proof and the control algorithm are well known for the Benes network, which is intrinsically symmetric. However, there has been little progress for the case of nonsymmetric networks of similar hardware requirements.