Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
ComPaSS: efficient communication services for scalable architectures
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Document for a Standard Message-Passing Interface
Document for a Standard Message-Passing Interface
Sufficient Conditions for Optimal Multicast Communication
ICPP '97 Proceedings of the international Conference on Parallel Processing
Popularity-Independent Multimedia-on-Demand Server Model
COMPSAC '00 24th International Computer Software and Applications Conference
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Hi-index | 0.00 |
This paper presents efficient algorithms that implement one-to-many, or multicast, communication in wormhole-routed torus networks. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a multicast message to m - 1 destinations in [log_2 m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks are also given.