MPI-I-2002-1-008

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

Sanders, Peter and Träff, Jesper Larsson

MPI-I-2002-1-008. February 2002, 8 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	176 KBytes; 186 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2002-1-008

BibTeX
@TECHREPORT{SandersTräff2002, AUTHOR = {Sanders, Peter and Tr{\"a}ff, Jesper Larsson}, TITLE = {The factor algorithm for all-to-all communication on clusters of SMP nodes}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-2002-1-008}, MONTH = {February}, YEAR = {2002}, ISSN = {0946-011X},}