The factor algorithm for all-to-all communication on clusters of SMP nodes

Sanders, Peter; Träff, Jesper Larsson

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

The factor algorithm for all-to-all communication on clusters of SMP nodes

MPS-Authors

/persons/resource/persons45344

Sanders, Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45632

Träff, Jesper Larsson
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

2002-1-008
(Any fulltext), 11KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Sanders, P., & Träff, J. L.(2002). The factor algorithm for all-to-all communication on clusters of SMP nodes (MPI-I-2002-1-008). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-6C8F-7

Abstract

We present an algorithm for all-to-all personalized communication, in which every processor has an individual message to deliver to every other processor. The machine model we consider is a cluster of processing nodes where each node, possibly consisting of several processors, can participate in only one communication operation with another node at a time. The nodes may have different numbers of processors. This general model is important for the implementation of all-to-all communication in libraries such as MPI where collective communication may take place over arbitrary subsets of processors. The algorithm is simple and optimal up to an additive term that is small if the total number of processors is large compared to the maximal number of processors in a node.