By Topic

Computing global combine operations in the multi-port postal model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Bar-Noy, A. ; IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA ; Bruck, J. ; Ho, C.-T. ; Kipnis, S.
more authors

Consider a message-passing system of n processors and each holds one piece of data initially. The goal is to compute an associative and commutative reduction function on the n distributed pieces of data and to make the result known to all the processors. We model the message-passing system using the parameter k for the k-port model and the parameter λ for the communication latency in the postal model. In this general model, each processor during each round r can send messages to any set of k processors and receive messages from any other set of k processors, which were set out during round r-λ+1, provided r-λ+1⩾1 We describe an optimal algorithm that requires the least number of communication rounds and minimizes the time spent by each processor in sending an receiving messages

Published in:

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Date of Conference:

1-4 Dec 1993