Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
The REFINE multiprocessor—theoretical properties and algorithms
Parallel Computing
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Parallel stereocorrelation on a reconfigurable multi-ring network
The Journal of Supercomputing - Special issue on parallel and distributed processing
Parallel Computer Vision on a Reconfigurable Multiprocessor Network
IEEE Transactions on Parallel and Distributed Systems
Path-based multicast communication in wormhole-routed unidirectional torus networks
Journal of Parallel and Distributed Computing
Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Turn Grouping for Multicast in Wormhole-Routed Mesh Networks Supporting the Turn Model
The Journal of Supercomputing
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.01 |
The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance of the proposed schemes with the performance of the scheme presented in our previous work. Both of the two proposed schemes have been proven to be deadlock-free. The first scheme, simple multipath routing, uses multiple independent paths for concurrent multicasting. The second scheme, two-phase multipath routing, includes two phases: source-to-relay and relay-to-destination. For each phase, multicasting is carried out using simple multipath routing. Experimental results show that, for short and medium messages with small message startup latencies, the proposed schemes reduce multicast latency more efficiently than other schemes.