Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees

Abstract We consider the broadcasting operation in point-to-point packet-switched parallel and distributed networks of processors. We develop a general technique for the design of optimal broadcast algorithms on a wide range of such systems. The technique works by modelling broadcast algorithms using lopsided trees, i.e., trees in which different edges can have different lengths. This technique makes it easier to design such algorithms and, furthermore, provides generating function and Mellin transform tools that can be used to derive precise analyses of their running times. As direct applications of this method we give an exact analysis of a known algorithm for the POSTAL model, and design and analyze an optimal broadcast algorithm for the MULTI_PORT MULTI_MEDIA model. We then show how our method can be applied to networks with different underlying topologies, by designing and giving an exact analysis of an optimal broadcast algorithm for the OPITCAL_RING .

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

[2]  Jehoshua Bruck,et al.  On the design and implementation of broadcast and global combine operations using the postal model , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[3]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[4]  Ashok V. Krishnamoorthy,et al.  Optically augmented 3-D computer: technology and architecture , 1994, First International Workshop on Massively Parallel Processing Using Optical Interconnections.

[5]  Herbert S. Wilf,et al.  Generating functionology , 1990 .

[6]  Uzi Efron,et al.  Applying Optical Interconnects to the 3-D Computer: A Performance Evaluation , 1986, J. Parallel Distributed Comput..

[7]  Amotz Bar-Noy,et al.  Designing broadcasting algorithms in the postal model for message-passing systems , 1992, SPAA '92.

[8]  Edward M. Reingold,et al.  Optimum lopsided binary trees , 1989, JACM.

[9]  Nicholas Pippenger.  An Elementary Approach to Some Analytic Asymptotics , 1993 .

[10]  Shay Kutten,et al.  Optimal Computation of Global Sensitive Functions in Fast Networks , 1990, WDAG.

[11]  Jehoshua Bruck,et al.  Efficient algorithms for all-to-all communications in multi-port message-passing systems , 1994, SPAA '94.

[12]  Jehoshua Bruck,et al.  Efficient Global Combine Operations in Multi-Port Message-Passing Systems , 1993, Parallel Process. Lett..

[13]  Richard M. Karp,et al.  Minimum-redundancy coding for the discrete noiseless channel , 1961, IRE Trans. Inf. Theory.

[14]  D. Knuth,et al.  Recurrence relations based on minimization , 1974 .

[15]  Richard M. Karp,et al.  Optimal broadcast and summation in the LogP model , 1993, SPAA '93.

[16]  Baruch Schieber,et al.  optimal Computation of Census Functions in the Postal Model , 1995, Discret. Appl. Math..

[17]  Amotz Bar-Noy,et al.  Broadcasting Multiple Messages in Simultaneous Send/receive Systems , 1994, Discret. Appl. Math..

[18]  Jehoshua Bruck,et al.  Computing Global Combine Operations in the Multiport Postal Model , 1995, IEEE Trans. Parallel Distributed Syst..

[19]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[20]  Amotz Bar-Noy,et al.  Multiple message broadcasting in the postal model , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[21]  Jehoshua Bruck,et al.  Multiple message broadcasting with generalized Fibonacci trees , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[22]  Günter Rote,et al.  A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs , 1998, IEEE Trans. Inf. Theory.

[23]  Mordecai J. Golin,et al.  Lopsided Trees: Analyses, Algorithms, and Applications , 1996, ICALP.

[24]  Baruch Schieber,et al.  Optimal multiple message broadcasting in telephone-like communication systems , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[25]  Baruch Schieber,et al.  An Optimal Algorithm for computing Census Functions in Message-Passing Systems , 1993, Parallel Process. Lett..