@techreport{MPI-I-2002-1-008,
TITLE = {The factor algorithm for all-to-all communication on clusters of {SMP} nodes},
AUTHOR = {Sanders, Peter and Tr{\"a}ff, Jesper Larsson},
LANGUAGE = {eng},
NUMBER = {MPI-I-2002-1-008},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2002},
DATE = {2002},
ABSTRACT = {We present an algorithm for all-to-all personalized<br>communication, in which every processor has an individual message to<br>deliver to every other processor. The machine model we consider is a<br>cluster of processing nodes where each node, possibly consisting of<br>several processors, can participate in only one communication<br>operation with another node at a time. The nodes may have different<br>numbers of processors. This general model is important for the<br>implementation of all-to-all communication in libraries such as MPI<br>where collective communication may take place over arbitrary subsets<br>of processors. The algorithm is simple and optimal up to an additive<br>term that is small if the total number of processors is large compared<br>to the maximal number of processors in a node.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}