Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets

Multinode broadcast (MNB) in a hypercube and in a ring network of processors is considered. It is assumed that the lengths of the packets that are broadcast are not fixed, but are distributed according to some probabilistic rule, and the optimal times required to execute the MNB are compared for variable and for fixed packet lengths. For large hypercubes, it is shown, under very general probabilistic assumptions on the packet lengths, that the MNB is completed in essentially the same time as when the packet lengths are fixed. In particular, the MNB is completed by time (1+ delta )T/sub s/ with probability at least 1- epsilon , for any positive epsilon and delta , where T/sub s /is the optimal time required to execute the MNB when the packet lengths are fixed at their mean, provided that the size of the hypercube is large enough. In the case of the ring, it is proved that the average time required to execute a MNB when the packet lengths are exponentially distributed exceeds by a factor of ln n the corresponding time for the case there the packet lengths are fixed at their mean, where n is the number of nodes of the ring. >

[1]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

[2]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[3]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[4]  Oliver A. McBryan,et al.  Hypercube Algorithms and Implementations , 1985, PPSC.

[5]  Ilse C. F. Ipsen,et al.  How to Embed Trees in Hypercubes. , 1985 .

[6]  Donald M. Topkis,et al.  Concurrent Broadcast for Information Dissemination , 1985, IEEE Transactions on Software Engineering.

[7]  Quentin F. Stout,et al.  Passing messages in link-bound hypercubes , 1986 .

[8]  Decision Systems.,et al.  Communication Aspects of Parallel Processing , 1987 .

[9]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[10]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[11]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[12]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[13]  Yousef Saad,et al.  Data communication in parallel architectures , 1989, Parallel Comput..

[14]  Yousef Saad,et al.  Data Communication in Hypercubes , 1989, J. Parallel Distributed Comput..

[15]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[16]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[17]  John N. Tsitsiklis,et al.  Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..

[18]  Emmanouel A. Varvarigos,et al.  Communication algorithms for isotropic tasks in hypercubes and wraparound meshes , 1992, Parallel Comput..

[19]  John N. Tsitsiklis,et al.  Efficient Routing Schemes for Multiple Broadcasts in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..