Optimal point-to-point broadcast algorithms via lopsided trees

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. Our technique makes it easier to design such algorithms and, furthermore, provides 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 OPTICAL RING.

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

[2]  Larry Rudolph,et al.  Limitations on optical free-space crossbarlike interconnection networks , 1990, Other Conferences.

[3]  Günter Rote,et al.  A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs , 1995, ICALP.

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

[5]  Assaf Schuster,et al.  Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees , 1999, Discret. Appl. Math..

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

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

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

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

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

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

[12]  Amotz Bar-Noy,et al.  Broadcasting multiple messages in simultaneous send/receive systems , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[13]  Jehoshua Bruck,et al.  Computing global combine operations in the multi-port postal model , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

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

[15]  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.

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

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

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

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