Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
Hypercube algorithms and implementations
SIAM Journal on Scientific and Statistical Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Data communication in hypercubes
Journal of Parallel and Distributed Computing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Dynamic Broadcasting in Parallel Computing
IEEE Transactions on Parallel and Distributed Systems
Routing Schemes for Multiple Random Broadcasts in Arbitrary Network Topologies
IEEE Transactions on Parallel and Distributed Systems
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Routing and Embeddings in Super Cayley Graphs
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Hi-index | 0.00 |
Multinode broadcast (MNB) in a hypercube and in a ring network of processors isconsidered. It is assumed that the lengths of the packets that are broadcast are notfixed, but are distributed according to some probabilistic rule, and the optimal timesrequired to execute the MNB are compared for variable and for fixed packet lengths. Forlarge hypercubes, it is shown, under very general probabilistic assumptions on the packetlengths, that the MNB is completed in essentially the same time as when the packetlengths are fixed. In particular, the MNB is completed by time (1+ delta )T/sub s/ withprobability at least 1- epsilon , for any positive epsilon and delta , where T/sub s /is theoptimal time required to execute the MNB when the packet lengths are fixed at theirmean, provided that the size of the hypercube is large enough. In the case of the ring, itis proved that the average time required to execute a MNB when the packet lengths areexponentially distributed exceeds by a factor of ln n the corresponding time for the casethere the packet lengths are fixed at their mean, where n is the number of nodes of thering.