A self-routing permutation network
Journal of Parallel and Distributed Computing
Nonblocking Broadcast Switching Networks
IEEE Transactions on Computers
Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network
IEEE Transactions on Computers
New Self-Routing Permutation Networks
IEEE Transactions on Computers
A New Self-Routing Permutation Network
IEEE Transactions on Computers
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Broadcast Ring Sandwich Networks
IEEE Transactions on Computers
Nonblocking WDM Multicast Switching Networks
IEEE Transactions on Parallel and Distributed Systems
A New Conference Network for Group Communication
IEEE Transactions on Computers
Nonblocking k-Fold Multicast Networks
IEEE Transactions on Parallel and Distributed Systems
Nonblocking k-Fold Multicast Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Nonblocking WDM Multicast Switching Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A Service-Centric Multicast Architecture and Routing Protocol
IEEE Transactions on Parallel and Distributed Systems
TELE-INFO'05 Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics
ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
Hi-index | 0.00 |
In this paper, we propose a design for a new self-routing multicast network which can realize arbitrary multicast assignments between its inputs and outputs without any blocking. The network design uses a recursive decomposition approach and is based on the binary radix sorting concept. All functional components of the network are reverse banyan networks. Specifically, the new multicast network is recursively constructed by cascading a binary splitting network and two half-size multicast networks. The binary splitting network, in turn, consists of two recursively constructed reverse banyan networks. The first reverse banyan network serves as a scatter network and the second reverse banyan network serves as a quasisorting network. The advantage of this approach is to provide a way to self-route multicast assignments through the network and a possibility to reuse part of network to reduce the network cost. The new multicast network we design is compared favorably with the previously proposed multicast networks. It uses $O(n\log^2 n)$ logic gates, and has $O(\log^2 n)$ depth and $O(\log^2 n)$ routing time where the unit of time is a gate delay. By reusing part of the network, the feedback implementation of the network can further reduce the network cost to $O(n\log n)$.