Efficient algorithms for all-to-all communications in multiport message-passing systems

Author

Bruck, Jehoshua ; Ho, Ching-Tien ; Kipnis, Shlomo ; Upfal, Eli ; Weathersby, Derrick

Author_Institution

California Inst. of Technol., Pasadena, CA, USA

Volume

8

Issue

11

fYear

1997

fDate

11/1/1997 12:00:00 AM

Firstpage

1143

Lastpage

1156

Abstract

We present efficient algorithms for two all-to-all communication operations in message-passing systems: index (or all-to-all personalized communication) and concatenation (or all-to-all broadcast). We assume a model of a fully connected message-passing system, in which the performance of any point-to-point communication is independent of the sender-receiver pair. We also assume that each processor has k⩾1 ports, through which it can send and receive k messages in every communication round. The complexity measures we use are independent of the particular system topology and are based on the communication start-up time, and on the communication bandwidth

Keywords

communication complexity; message passing; parallel algorithms; all-to-all communications; communication bandwidth; communication start-up; complexity measures; concatenation; index; message-passing systems; multiport; point-to-point communication; sender-receiver pair; Algorithm design and analysis; Application software; Bandwidth; Broadcasting; Concurrent computing; Parallel programming; Particle measurements; Scattering; Time measurement; Topology;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.642949

Filename

642949