Multicast in hypercube multiprocessors
Journal of Parallel and Distributed Computing
Distributed, Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks
IEEE Transactions on Computers
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
Efficient Fault-Tolerant Multicast Scheme for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Multicast algorithms for hypercube multiprocessors
Journal of Parallel and Distributed Computing
Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IEEE Transactions on Computers
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
On the Optimal Network for Multicomputers: Torus or Hypercube?
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Optimal Topology for Distributed Shared-Memory Multiprocessors: Hypercubes Again?
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Optimal broadcasting in injured hypercubes using directed safety levels
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Unicast-based fault-tolerant multicasting in wormhole-routed hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably based on information related to the maximal safe subcube. A time-optimal multicasting exists if (1) the multicast source is locally safe in the minimum subcube that contains the source and destinations (called a multicast subcube), or (2) the spanning subcube between each destination and the source is safe. We show a sufficient condition for the existence of a multicasting is: the multicast subcube is safe or the spanning subcube between the source and each destination is either safe or is contained in a safe subcube. Methods are presented to set up a partial multicast tree when the above sufficient conditions fail. It is shown that effectiveness of the algorithm can be improved drastically using the partial multicast tree setup technique. Extensive simulation results are also presented.