Dune Core Modules (2.3.1)
Collective communication interface and sequential default implementation. More...
#include <dune/common/parallel/collectivecommunication.hh>
Public Member Functions | |
| CollectiveCommunication () | |
| Construct default object. | |
| int | rank () const |
| Return rank, is between 0 and size()-1. | |
| int | size () const |
| Number of processes in set, is greater than 0. | |
| template<typename T > | |
| T | sum (T &in) const |
| Compute the sum of the argument over all processes and return the result in every process. Assumes that T has an operator+. | |
| template<typename T > | |
| int | sum (T *inout, int len) const |
| Compute the sum over all processes for each component of an array and return the result in every process. Assumes that T has an operator+. | |
| template<typename T > | |
| T | prod (T &in) const |
| Compute the product of the argument over all processes and return the result in every process. Assumes that T has an operator*. | |
| template<typename T > | |
| int | prod (T *inout, int len) const |
| Compute the product over all processes for each component of an array and return the result in every process. Assumes that T has an operator*. | |
| template<typename T > | |
| T | min (T &in) const |
| Compute the minimum of the argument over all processes and return the result in every process. Assumes that T has an operator<. | |
| template<typename T > | |
| int | min (T *inout, int len) const |
| Compute the minimum over all processes for each component of an array and return the result in every process. Assumes that T has an operator<. | |
| template<typename T > | |
| T | max (T &in) const |
| Compute the maximum of the argument over all processes and return the result in every process. Assumes that T has an operator<. | |
| template<typename T > | |
| int | max (T *inout, int len) const |
| Compute the maximum over all processes for each component of an array and return the result in every process. Assumes that T has an operator<. | |
| int | barrier () const |
| Wait until all processes have arrived at this point in the program. | |
| template<typename T > | |
| int | broadcast (T *inout, int len, int root) const |
| Distribute an array from the process with rank root to all other processes. | |
| template<typename T > | |
| int | gather (T *in, T *out, int len, int root) const |
| Gather arrays on root task. More... | |
| template<typename T > | |
| int | scatter (T *send, T *recv, int len, int root) const |
| Scatter array from a root to all other task. More... | |
| template<typename T > | |
| int | allgather (T *sbuf, int count, T *rbuf) const |
| Gathers data from all tasks and distribute it to all. More... | |
| template<typename BinaryFunction , typename Type > | |
| int | allreduce (Type *inout, int len) const |
| Compute something over all processes for each component of an array and return the result in every process. More... | |
| template<typename BinaryFunction , typename Type > | |
| void | allreduce (Type *in, Type *out, int len) const |
| Compute something over all processes for each component of an array and return the result in every process. More... | |
Detailed Description
class Dune::CollectiveCommunication< C >
Collective communication interface and sequential default implementation.
CollectiveCommunication offers an abstraction to the basic methods of parallel communication, following the message-passing paradigm. It allows to switch parallel features on and off, without changing the code. Currently only MPI and sequential code are supported.
A CollectiveCommunication object is returned by all grids (also the sequential ones) in order to allow code to be written in a transparent way for sequential and parallel grids.
This class provides a default implementation for sequential grids. The number of processes involved is 1, any sum, maximum, etc. returns just its input argument and so on.
In specializations one can implement the real thing using appropriate communication functions, e.g. there exists an implementation using the Message Passing Interface (MPI), see Dune::CollectiveCommunication<MPI_Comm>.
Moreover, the communication subsystem used by an implementation is not visible in the interface, i.e. Dune grid implementations are not restricted to MPI.
Member Function Documentation
◆ allgather()
|
inline |
Gathers data from all tasks and distribute it to all.
The block of data sent from the jth process is received by every process and placed in the jth block of the buffer recvbuf.
- Parameters
-
[in] sbuf The buffer with the data to send. Has to be the same for each task. [in] count The number of elements to send by any process. [out] rbuf The receive buffer for the data. Has to be of size notasks*count, with notasks being the number of tasks in the communicator.
◆ allreduce() [1/2]
|
inline |
Compute something over all processes for each component of an array and return the result in every process.
The template parameter BinaryFunction is the type of the binary function to use for the computation
- Parameters
-
in The array to compute on. out The array to store the results in. len The number of components in the array
◆ allreduce() [2/2]
|
inline |
Compute something over all processes for each component of an array and return the result in every process.
The template parameter BinaryFunction is the type of the binary function to use for the computation
- Parameters
-
inout The array to compute on. len The number of components in the array
◆ gather()
|
inline |
Gather arrays on root task.
Each process sends its in array of length len to the root process (including the root itself). In the root process these arrays are stored in rank order in the out array which must have size len * number of processes.
- Parameters
-
[in] in The send buffer with the data to send. [out] out The buffer to store the received data in. Might have length zero on non-root tasks. [in] len The number of elements to send on each task. [out] root The root task that gathers the data.
◆ scatter()
|
inline |
Scatter array from a root to all other task.
The root process sends the elements with index from k*len to (k+1)*len-1 in its array to task k, which stores it at index 0 to len-1.
- Parameters
-
[in] send The array to scatter. Might have length zero on non-root tasks. [out] recv The buffer to store the received data in. Upon completion of the method each task will have same data stored there as the one in send buffer of the root task before. [in] len The number of elements in the recv buffer. [out] root The root task that gathers the data.
The documentation for this class was generated from the following file:
- dune/common/parallel/collectivecommunication.hh
|
Legal Statements / Impressum |
Hosted by TU Dresden |
generated with Hugo v0.111.3
(Nov 12, 23:30, 2024)