Multi-address Encoding for Multicast
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Efficient software multicast in wormhole-routed unidirectional multistage networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Efficient Broadcast and Multicast on Multistage Interconnnection Networks using Multiport Encoding
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Multicast snooping: a new coherence method using a multicast address network
ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Optimal All-to-All Personalized Exchange in Self-Routable Multistage Networks
IEEE Transactions on Parallel and Distributed Systems
Look-ahead adaptive routing on k-ary n-trees
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
| Hi-index | 0.00 |
In this paper, we propose a tree-based multicasting algorithm for Multistage Interconnection Networks (MINs). We first analyze the necessary conditions for deadlocks in MINs. Based on these observations, an asynchronous tree-based multicasting algorithm is developed in which deadlocks are prevented by serializing the initiations of branching operations that have potential for creating deadlocks. The serialization is done using a technique based on grouping of the switching elements. The preliminary simulation results are encouraging as it lowers the latency by almost a factor of 4 when compared with the software multicasting approach proposed earlier.