optimal Computation of Census Functions in the Postal Model

Abstract We consider the problem of computing a census function among n processors in a message-passing system. In this problem, each of the n processors holds one piece of data initially. The goal is to compute an associative and commutative census function h on the n distributed pieces of data and to make the result known to all the processors. To perform the computation, processors send messages to and receive messages from one another in specified communication rounds. To model the communication latencies inherent in many modern message-passing systems, we use the postal model which was recently introduced by Bar-Noy and Kipnis. In this model, a message sent by one processor in a given round is received by another processor only several rounds later. This paper describes an optimal algorithm for the census problem in the postal model. The algorithm requires the least number of communication rounds and minimizes the time spent by each processor in sending and receiving messages.

[1]  Mark A. Johnson,et al.  Solving problems on concurrent processors. Vol. 1: General techniques and regular problems , 1988 .

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

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

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

[5]  Andrew A. Chien,et al.  The J-Machine: A Fine Grain Concurrent Computer , 1989 .

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

[7]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[8]  W. David Sincoskie,et al.  The AURORA Gigabit Testbed , 1993, Comput. Networks ISDN Syst..

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

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

[11]  Marilyn Bohl,et al.  Information processing , 1971 .

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

[13]  Shay Kutten,et al.  New models and algorithms for future networks , 1988, PODC '88.

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

[15]  Dennis G. Shea,et al.  Architecture and implementation of Vulcan , 1994, Proceedings of 8th International Parallel Processing Symposium.

[16]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[17]  Walter Knödel,et al.  New gossips and telephones , 1975, Discret. Math..

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