Combinatorica
Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network
IEEE Transactions on Computers
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Design and optimization of switching fabrics for atm networks and parallel computer systems
Design and optimization of switching fabrics for atm networks and parallel computer systems
Generating highly-routable sparse crossbars for PLDs
FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
FPGA test time reduction through a novel interconnect testing scheme
FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
Designing WDM Optical Interconnects with Full Connectivity by Using Limited Wavelength Conversion
IEEE Transactions on Computers
Cost-Effective Designs of WDM Optical Interconnects
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n驴m inputs to its m outputs, possibly without the ability to distinguish their order. Fat-and-slim crossbars were introduced recently to show that bipartite concentrators can be constructed with a minimum number of crosspoints for any number of inputs and outputs. We generalize these graphs to obtain bipartite concentrators with nearly a fixed fanout without altering their (n$-$m + 1)m crosspoint complexity. We also present an O(log n)-time algorithm to route arbitrary concentration assignments on this new family of fat-and-slim crossbars.