Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
Nonblocking Broadcast Switching Networks
IEEE Transactions on Computers
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
The Cache-Coherence Problem in Shared-Memory Multiprocessors: Hardware Solutions
The Cache-Coherence Problem in Shared-Memory Multiprocessors: Hardware Solutions
Optimal software multicast in wormhole-routed multistage networks
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Broadcast Ring Sandwich Networks
IEEE Transactions on Computers
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
NEC Corporation: NEC Cenju-3: A Microprocessor-Based Parallel Computer
Proceedings of the 8th International Symposium on Parallel Processing
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
| Hi-index | 0.00 |
Multicast or one-to-many communications arise frequently in parallel computing applications and in other communication environments. Multicast networks can simultaneously support multiple multicast connections between the network inputs and network outputs. However, due to the much more complex communication patterns and routing control in multicast networks, there is still a considerably large gap in network cost between even the currently best known multicast networks and permutation networks. In this paper, we will present a class of interconnection networks which can support a substantial amount of well-defined multiple multicast connections in a nonblocking fashion and yet have a comparable low cost to permutation networks. We will also provide an efficient routing algorithm for satisfying multicast connection requests in such networks. Moreover, the multicast connecting capability of the networks will be represented as a function of fundamental network structural parameters so that the trade-off between the network multicast capability and the network cost can be determined. This enables different system designers to choose the multicast networks which fit in their particular application needs. By utilizing a network with well-defined multicast capability in a parallel computing system, software or algorithm designers of the system will be able to make full use of the multicast capability provided by the network, and substantial improvements in the performance of the system can be achieved due to significantly shortened delays in data transfer and simplified synchronization mechanisms for shared data.