Abstract
Collective communication operations play an important role in message-passing systems and have been extensively investigated. We study two widely used collective communication operations: gossiping and all-to-all personalized communication. We assume the multiport postal model of communication that seems particularly suited for developing fast and portable algorithms on current technology parallel computers. Unlike most of the previous work on the subject, we assume that processors communicate by sending messages of limited size. Indeed, when the maximum size of a message is fixed, the number of rounds required by a communication algorithm gives a realistic measure of the performance of the algorithm. We provide an optimal algorithm for the gossiping operation and an almost-optimal algorithm for the all-to-all personalized communication operation. © 1998 John Wiley & Sons, Inc. Networks 31:67–79, 1998
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
