MPI_IREDUCE(3)
MPI_IREDUCE β¨π
MPI_IREDUCE(3) Β· Open MPI Β· MPI_IREDUCE(3)
okay bestie, come sit with me because this page is a whole vibe and you're gonna want the full tea π«
πΈ NAME πΈ
MPI_Reduce, MPI_Ireduce, MPI_Reduce_init β Reduces values on all processes within a group. π
π SYNTAX π
β¨ C Syntax β¨
#include <mpi.h>
int MPI_Reduce(const void *sendbuf, void *recvbuf, int count,
MPI_Datatype datatype, MPI_Op op, int root,
MPI_Comm comm)
int MPI_Ireduce(const void *sendbuf, void *recvbuf, int count,
MPI_Datatype datatype, MPI_Op op, int root,
MPI_Comm comm, MPI_Request *request)
int MPI_Reduce_init(const void *sendbuf, void *recvbuf, int count,
MPI_Datatype datatype, MPI_Op op, int root,
MPI_Comm comm, MPI_Info info, MPI_Request *request)
π Fortran Syntax π
USE MPI
! or the older form: INCLUDE 'mpif.h'
MPI_REDUCE(SENDBUF, RECVBUF, COUNT, DATATYPE, OP, ROOT, COMM,
IERROR)
<type> SENDBUF(*), RECVBUF(*)
INTEGER COUNT, DATATYPE, OP, ROOT, COMM, IERROR
MPI_IREDUCE(SENDBUF, RECVBUF, COUNT, DATATYPE, OP, ROOT, COMM,
REQUEST, IERROR)
<type> SENDBUF(*), RECVBUF(*)
INTEGER COUNT, DATATYPE, OP, ROOT, COMM, REQUEST, IERROR
MPI_REDUCE_INIT(SENDBUF, RECVBUF, COUNT, DATATYPE, OP, ROOT, COMM,
INFO, REQUEST, IERROR)
<type> SENDBUF(*), RECVBUF(*)
INTEGER COUNT, DATATYPE, OP, ROOT, COMM, INFO, REQUEST, IERROR
π¦ Fortran 2008 Syntax π¦
USE mpi_f08
MPI_Reduce(sendbuf, recvbuf, count, datatype, op, root, comm, ierror)
TYPE(*), DIMENSION(..), INTENT(IN) :: sendbuf
TYPE(*), DIMENSION(..) :: recvbuf
INTEGER, INTENT(IN) :: count, root
TYPE(MPI_Datatype), INTENT(IN) :: datatype
TYPE(MPI_Op), INTENT(IN) :: op
TYPE(MPI_Comm), INTENT(IN) :: comm
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_Ireduce(sendbuf, recvbuf, count, datatype, op, root, comm, request,
ierror)
TYPE(*), DIMENSION(..), INTENT(IN), ASYNCHRONOUS :: sendbuf
TYPE(*), DIMENSION(..), ASYNCHRONOUS :: recvbuf
INTEGER, INTENT(IN) :: count, root
TYPE(MPI_Datatype), INTENT(IN) :: datatype
TYPE(MPI_Op), INTENT(IN) :: op
TYPE(MPI_Comm), INTENT(IN) :: comm
TYPE(MPI_Request), INTENT(OUT) :: request
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_Reduce_init(sendbuf, recvbuf, count, datatype, op, root, comm, info, request,
ierror)
TYPE(*), DIMENSION(..), INTENT(IN), ASYNCHRONOUS :: sendbuf
TYPE(*), DIMENSION(..), ASYNCHRONOUS :: recvbuf
INTEGER, INTENT(IN) :: count, root
TYPE(MPI_Datatype), INTENT(IN) :: datatype
TYPE(MPI_Op), INTENT(IN) :: op
TYPE(MPI_Comm), INTENT(IN) :: comm
TYPE(MPI_Info), INTENT(IN) :: info
TYPE(MPI_Request), INTENT(OUT) :: request
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
π₯ INPUT PARAMETERS π₯
sendbufβ Address of send buffer (choice). πcountβ Number of elements in send buffer (integer).datatypeβ Data type of elements of send buffer (handle).opβ Reduce operation (handle).rootβ Rank of root process (integer). πcommβ Communicator (handle).infoβ Info (handle, persistent).
π€ OUTPUT PARAMETERS π€
recvbufβ Address of receive buffer (choice, significant only at root).requestβ Request (handle, non-blocking only).ierrorβ Fortran only: Error status (integer). π
π DESCRIPTION π
The global reduce functions (MPI_Reduce, MPI_Op_create, MPI_Op_free, MPI_Allreduce, MPI_Reduce_scatter, MPI_Scan) perform a global reduce operation (such as sum, max, logical AND, etc.) across all the members of a group. π« The reduction operation can be either one of a predefined list of operations, or a user-defined operation. The global reduction functions come in several flavors, bestie:
- a reduce that returns the result of the reduction at one node,
- an all-reduce that returns this result at all nodes, and
- a scan (parallel prefix) operation. π
In addition, a reduce-scatter operation combines the functionality of a reduce and a scatter operation. two-for-one, iconic behavior.
MPI_Reduce combines the elements provided in the input buffer of each process in the group, using the operation op, and returns the combined value in the output buffer of the process with rank root. The input buffer is defined by the arguments sendbuf, count, and datatype; the output buffer is defined by the arguments recvbuf, count, and datatype; both have the same number of elements, with the same type. The routine is called by all group members using the same arguments for count, datatype, op, root, and comm. So like, everyone has to be on the same page, fr fr. Thus, all processes provide input buffers and output buffers of the same length, with elements of the same type.
Each process can provide one element, or a sequence of elements, in which case the combine operation is executed element-wise on each entry of the sequence. For example, if the operation is MPI_MAX and the send buffer contains two elements that are floating-point numbers (count = 2 and datatype = MPI_FLOAT), then:
recvbuf(1) = global max (sendbuf(1))
recvbuf(2) = global max(sendbuf(2))
see how that works? element by element, no notes. π₯
π USE OF IN-PLACE OPTION π
When the communicator is an intracommunicator, you can perform a reduce operation in-place (the output buffer is used as the input buffer). Use the variable MPI_IN_PLACE as the value of the root process sendbuf. In this case, the input data is taken at the root from the receive buffer, where it will be replaced by the output data. β¨
Note thatMPI_IN_PLACEis a special kind of value; it has the same restrictions on its use asMPI_BOTTOM. π¨ respect the restrictions bestie, they are NOT decorative.
Because the in-place option converts the receive buffer into a send-and-receive buffer, a Fortran binding that includes INTENT must mark these as INOUT, not OUT. do not skip this, the compiler will simply end you π
π WHEN COMMUNICATOR IS AN INTER-COMMUNICATOR π
When the communicator is an inter-communicator, the root process in the first group combines data from all the processes in the second group and then performs the op operation. The first group defines the root process. That process uses MPI_ROOT as the value of its root argument. The remaining processes use MPI_PROC_NULL as the value of their root argument. All processes in the second group use the rank of that root process in the first group as the value of their root argument. Only the send buffer arguments are significant in the second group, and only the receive buffer arguments are significant in the root process of the first group. π§
β¨ PREDEFINED REDUCE OPERATIONS β¨
okay so MPI comes with a whole lil starter pack of operations, and they're listed right here (Predefined Reduce Operations). That same section also tells you which datatypes each one is allowed to touch. BUT WAIT β you're not stuck with just these, bestie. You can define your own operations too, and overload them so they work on several datatypes, basic or derived. All the deets on that live in the user-defined operations lore (go peek at the man pages for MPI_Op_create and MPI_Op_free). π«Ά
The op argument is always assumed to be associative. And every single predefined operation is also assumed to be commutative. If you roll your own, you can make one that's assumed associative but not commutative β that's allowed, no cap.
So the "canonical" evaluation order of a reduction? It's determined by the ranks of the processes in the group. BUT the implementation is allowed to take advantage of associativity β or associativity plus commutativity β to switch up the order of evaluation. Why does that matter? Because for operations that aren't strictly associative and commutative (floating point addition, looking at you π) that can literally change the result of the reduction. it's giving "floating point strikes again" π
Predefined operators only work with the MPI types listed below (Predefined Reduce Operations, plus the MINLOC and MAXLOC section further down). User-defined operators though? They can operate on general, derived datatypes. In that case, each argument that the reduce operation gets applied to is one element described by such a datatype β and that element might contain several basic values inside it. More on this in Section 4.9.4 of the MPI Standard, "User-Defined Operations." πΈ
So these are the predefined operations that get supplied for MPI_Reduce and its little related function family: MPI_Allreduce, MPI_Reduce_scatter, and MPI_Scan. You invoke them by dropping the following name into op:
MPI_MAXβ maximumMPI_MINβ minimumMPI_SUMβ sumMPI_PRODβ productMPI_LANDβ logical andMPI_BANDβ bit-wise andMPI_LORβ logical orMPI_BORβ bit-wise orMPI_LXORβ logical xorMPI_BXORβ bit-wise xorMPI_MAXLOCβ max value and locationMPI_MINLOCβ min value and location
The two girlies MPI_MINLOC and MPI_MAXLOC get their own whole conversation down below (MINLOC and MAXLOC) because they're special like that π. For all the other predefined operations, here's the rundown of which op + datatype combos are actually legal.
First, group the MPI basic datatypes like this:
- C integer:
MPI_INT,MPI_LONG,MPI_SHORT,MPI_UNSIGNED_SHORT,MPI_UNSIGNED,MPI_UNSIGNED_LONG - Fortran integer:
MPI_INTEGER - Floating-point:
MPI_FLOAT,MPI_DOUBLE,MPI_REAL,MPI_DOUBLE_PRECISION,MPI_LONG_DOUBLE - Logical:
MPI_LOGICAL - Complex:
MPI_COMPLEX - Byte:
MPI_BYTE
Cool cool cool, now the valid datatypes for each operation:
MPI_MAX,MPI_MINβ C integer, Fortran integer, floating-pointMPI_SUM,MPI_PRODβ C integer, Fortran integer, floating-point, complexMPI_LAND,MPI_LOR,MPI_LXORβ C integer, logicalMPI_BAND,MPI_BOR,MPI_BXORβ C integer, Fortran integer, byte
Example 1: A routine that computes the dot product of two vectors that are distributed across a group of processes and returns the answer at process zero.
SUBROUTINE PAR_BLAS1(m, a, b, c, comm)
REAL a(m), b(m) ! local slice of array
REAL c ! result (at process zero)
REAL sum
INTEGER m, comm, i, ierr
! local sum
sum = 0.0
DO i = 1, m
sum = sum + a(i)*b(i)
END DO
! global sum
CALL MPI_REDUCE(sum, c, 1, MPI_REAL, MPI_SUM, 0, comm, ierr)
RETURN
Example 2: A routine that computes the product of a vector and an array that are distributed across a group of processes and returns the answer at process zero.
SUBROUTINE PAR_BLAS2(m, n, a, b, c, comm)
REAL a(m), b(m,n) ! local slice of array
REAL c(n) ! result
REAL sum(n)
INTEGER n, comm, i, j, ierr
! local sum
DO j= 1, n
sum(j) = 0.0
DO i = 1, m
sum(j) = sum(j) + a(i)*b(i,j)
END DO
END DO
! global sum
CALL MPI_REDUCE(sum, c, n, MPI_REAL, MPI_SUM, 0, comm, ierr)
! return result at process zero (and garbage at the other nodes)
RETURN
next up, the whole MINLOC / MAXLOC situation π¦
β¨ MINLOC AND MAXLOC β¨
okay bestie, this part is SO fun. π The operator MPI_MINLOC computes a global minimum AND an index that's attached to that minimum value. MPI_MAXLOC does the same thing but for a global maximum plus index. One classic use case: computing a global min (or max) and the rank of the process that's holding that value. chef's kiss. π
So the operation that defines MPI_MAXLOC is:
( u ) ( v ) ( w )
( ) o ( ) = ( )
( i ) ( j ) ( k )
where
w = max(u, v)
and
( i if u > v
(
k = ( min(i, j) if u = v
(
( j if u < v)
and MPI_MINLOC is defined basically the same way, just flipped:
( u ) ( v ) ( w )
( ) o ( ) = ( )
( i ) ( j ) ( k )
where
w = min(u, v)
and
( i if u < v
(
k = ( min(i, j) if u = v
(
( j if u > v)
Both of these ops are associative and commutative, which is the whole reason they're allowed to party in a reduce. π
Now here's the tea that actually matters: if you apply MPI_MAXLOC to reduce a sequence of pairs (u(0), 0), (u(1), 1), β¦, (u(n-1), n-1), then what comes back is (u , r) β where u = max(i) u(i), and r is the index of the first global maximum in that sequence. So if every process hands over a value plus its rank inside the group, then a reduce with op = MPI_MAXLOC gives you back the maximum value and the rank of the first process that had it. iconic behaviour honestly. Similarly, MPI_MINLOC can hand you a minimum and its index. More generally, MPI_MINLOC computes a lexicographic minimum, where the elements are ordered by the first component of each pair, and ties get broken using the second component. tie-breaker queen. π
The reduce operation is defined to work on arguments that consist of a pair: value and index. For both Fortran and C, types are provided to describe this pair. The potentially mixed-type nature of those arguments is a whole problem in Fortran. It's worked around, for Fortran, by having the MPI-provided type consist of a pair of the same type as value, and coercing the index to this type too. In C, the MPI-provided pair type has distinct types and the index is an int. bestie that's just how it is. π«Ά
To use MPI_MINLOC and MPI_MAXLOC in a reduce operation, you have to supply a datatype argument that represents a pair (value and index). MPI provides nine such predefined datatypes. The operations MPI_MAXLOC and MPI_MINLOC can be used with each of the following datatypes:
Fortran:
MPI_2REALβ pair of REALsMPI_2DOUBLE_PRECISIONβ pair of DOUBLE-PRECISION variablesMPI_2INTEGERβ pair of INTEGERs
C:
MPI_FLOAT_INTβ float and intMPI_DOUBLE_INTβ double and intMPI_LONG_INTβ long and intMPI_2INTβ pair of intsMPI_SHORT_INTβ short and intMPI_LONG_DOUBLE_INTβ long double and int
The data type MPI_2REAL is equivalent to:
MPI_TYPE_CONTIGUOUS(2, MPI_REAL, MPI_2REAL)
Similar statements apply for MPI_2INTEGER, MPI_2DOUBLE_PRECISION, and MPI_2INT.
The datatype MPI_FLOAT_INT is as if defined by this exact sequence of instructions:
type[0] = MPI_FLOAT
type[1] = MPI_INT
disp[0] = 0
disp[1] = sizeof(float)
block[0] = 1
block[1] = 1
MPI_TYPE_STRUCT(2, block, disp, type, MPI_FLOAT_INT)
Similar statements apply for MPI_LONG_INT and MPI_DOUBLE_INT.
πΈ Example 3
Every process has an array of 30 doubles, in C. For each of the 30 locations, compute the value and the rank of the process containing the largest value. π
...
/* each process has an array of 30 double: ain[30]
*/
double ain[30], aout[30];
int ind[30];
struct {
double val;
int rank;
} in[30], out[30];
int i, myrank, root;
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
for (i=0; i<30; ++i) {
in[i].val = ain[i];
in[i].rank = myrank;
}
MPI_Reduce( in, out, 30, MPI_DOUBLE_INT, MPI_MAXLOC, root, comm );
/* At this point, the answer resides on process root
*/
if (myrank == root) {
/* read ranks out
*/
for (i=0; i<30; ++i) {
aout[i] = out[i].val;
ind[i] = out[i].rank;
}
}
π¦ Example 4
Same example, but in Fortran. π
...
! each process has an array of 30 double: ain(30)
DOUBLE PRECISION :: ain(30), aout(30)
INTEGER :: ind(30)
DOUBLE PRECISION :: in(2,30), out(2,30)
INTEGER :: i, myrank, root, ierr
call MPI_COMM_RANK(MPI_COMM_WORLD, myrank)
DO I=1, 30
in(1,i) = ain(i)
in(2,i) = myrank ! myrank is coerced to a double
END DO
call MPI_REDUCE( in, out, 30, MPI_2DOUBLE_PRECISION, MPI_MAXLOC, root, &
comm, ierr )
! At this point, the answer resides on process root
IF (myrank == root) THEN
! read ranks out
DO I= 1, 30
aout(i) = out(1,i)
ind(i) = out(2,i) ! rank is coerced back to an integer
END DO
END IF
π Example 5
Every process has a nonempty array of values. Find the minimum global value, the rank of the process that holds it, and its index on this process. so many answers at once, we love a multitasker. β¨
#define LEN 1000
float val[LEN]; /* local array of values */
int count; /* local number of values */
int myrank, minrank, minindex;
float minval;
struct {
float value;
int index;
} in, out;
/* local minloc */
in.value = val[0];
in.index = 0;
for (i=1; i < count; i++)
if (in.value > val[i]) {
in.value = val[i];
in.index = i;
}
/* global minloc */
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
in.index = myrank*LEN + in.index;
MPI_Reduce( in, out, 1, MPI_FLOAT_INT, MPI_MINLOC, root, comm );
/* At this point, the answer resides on process root
*/
if (myrank == root) {
/* read answer out
*/
minval = out.value;
minrank = out.index / LEN;
minindex = out.index % LEN;
Also, tiny note bestie: all MPI objects (e.g., MPI_Datatype, MPI_Comm) are of type INTEGER in Fortran. π
π NOTES ON COLLECTIVE OPERATIONS π
The reduction functions ( MPI_Op ) do not return an error value. So as a result, if the functions detect an error, all they can do is either call MPI_Abort or silently skip the problem. Which meansβ¦ if you change the error handler from MPI_ERRORS_ARE_FATAL to something else, for example MPI_ERRORS_RETURN, then no error may be indicated. π yeah. it just won't tell you.
The reason for this is the performance problems in ensuring that all collective routines return the same error value. it's giving "we chose speed, sorry".
π ERRORS π
Almost all MPI routines return an error value; C routines as the return result of the function and Fortran routines in the last argument. classic.
Before the error value is returned, the current MPI error handler associated with the communication object (e.g., communicator, window, file) is called. If no communication object is associated with the MPI call, then the call is considered attached to MPI_COMM_SELF and will call the associated MPI error handler. When MPI_COMM_SELF is not initialized (i.e., before MPI_Init/MPI_Init_thread, after MPI_Finalize, or when using the Sessions Model exclusively) the error raises the initial error handler. The initial error handler can be changed by calling MPI_Comm_set_errhandler on MPI_COMM_SELF when using the World model, or the mpi_initial_errhandler CLI argument to mpiexec or info key to MPI_Comm_spawn/MPI_Comm_spawn_multiple. If no other appropriate error handler has been set, then the MPI_ERRORS_RETURN error handler is called for MPI I/O functions and the MPI_ERRORS_ABORT error handler is called for all other MPI functions.
Open MPI includes three predefined error handlers that can be used:
MPI_ERRORS_ARE_FATALβ Causes the program to abort all connected MPI processes.MPI_ERRORS_ABORTβ An error handler that can be invoked on a communicator, window, file, or session. When called on a communicator, it acts as ifMPI_Abortwas called on that communicator. If called on a window or file, acts as ifMPI_Abortwas called on a communicator containing the group of processes in the corresponding window or file. If called on a session, aborts only the local process.MPI_ERRORS_RETURNβ Returns an error code to the application.
MPI applications can also implement their own error handlers by calling:
MPI_Comm_create_errhandlerthenMPI_Comm_set_errhandlerMPI_File_create_errhandlerthenMPI_File_set_errhandlerMPI_Session_create_errhandlerthenMPI_Session_set_errhandleror atMPI_Session_initMPI_Win_create_errhandlerthenMPI_Win_set_errhandler
β οΈ Note that MPI does not guarantee that an MPI program can continue past an error. like, at all. proceed with caution bestie.
See the MPI man page for a full list of MPI error codes.
See the Error Handling section of the MPI-3.1 standard for more information.
See also:
MPI_AllreduceMPI_Reduce_scatterMPI_ScanMPI_Op_createMPI_Op_free
π the sign-off π
Copyright: 2003-2026, The Open MPI Community β and this page is dated Sep 10, 2026, living in section MPI_IREDUCE(3) of the manual. πβ¨
okay that's the whole page bestie, you ate that fr fr. go forth and reduce. πππ¦ no cap.
π¦ where this page comes from
- ubuntu stonking: openmpi-doc 5.0.10-6 Β· other
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms