Nonblocking Broadcast Switching Networks
IEEE Transactions on Computers
Universal switch modules for FPGA design
ACM Transactions on Design Automation of Electronic Systems (TODAES)
General Models and a Reduction Design Technique for FPGA Switch Box Designs
IEEE Transactions on Computers
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Decomposition Design Theory and Methodology for Arbitrary-Shaped Switch Boxes
IEEE Transactions on Computers
The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics)
The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics)
Design automation for reconfigurable interconnection networks
ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
| Hi-index | 0.00 |
In this paper we propose a new design for rearrangeable multicast switching networks, which uses the minimum number of intermediate nodes and a comparable number of switches. The newly designed 3-stage N ×N switching network has the minimum 2N intermediate nodes and O (N 5/3) switches and an efficient routing algorithm, while the best known wide-sense nonblocking (and hence rearrangeable) multicast 3-stage network uses O (N logN /loglogN ) intermediate nodes and O (N 3/2 logN /loglogN ) switches. The new design is constructed by adding switches to a rearrangeable unicast Clos network. The design and analysis of the design is done by a combinatorial approach, which represents a switching network as a multistage bipartite graph, and the middle stage as bipartite switch box, and routing requirements as hypergraph. The new routing algorithm is done by the edge ordering of regular hypergraphs, a technique originated from job scheduling.