5#ifndef DUNE_COMMON_PARALLEL_COMMUNICATION_HH
6#define DUNE_COMMON_PARALLEL_COMMUNICATION_HH
98 template<
typename Communicator>
296 return {std::forward<T>(data)};
323 template<
class TIN,
class TOUT = std::vector<TIN>>
326 return {std::forward<TOUT>(
data_out)};
386 template<
class TIN,
class TOUT = TIN>
389 return {std::forward<TOUT>(
data_out)};
444 template<
class TIN,
class TOUT = TIN>
446 return {std::forward<TOUT>(
data_out)};
485 template<
typename BinaryFunction,
typename Type>
495 template<
class BinaryFunction,
class TIN,
class TOUT = TIN>
498 return {std::forward<TOUT>(
data_out)};
505 template<
class BinaryFunction,
class T>
507 return {std::forward<T>(data)};
524 template<
typename BinaryFunction,
typename Type>
539 using CollectiveCommunication
540 [[deprecated(
"CollectiveCommunication is deprecated. Use Communication instead.")]]
A few common exception classes.
helper classes to provide unique types for standard functions
iterator begin()
Get an iterator that is positioned at the first element.
Definition arraylist.hh:517
#define DUNE_THROW(E, m)
Definition exceptions.hh:218
EnableIfInterOperable< T1, T2, bool >::type operator==(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for equality.
Definition iteratorfacades.hh:237
EnableIfInterOperable< T1, T2, bool >::type operator!=(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for inequality.
Definition iteratorfacades.hh:259
Dune namespace.
Definition alignedallocator.hh:13
A dynamically growing random access list.
Definition arraylist.hh:62
Default exception if an error in the parallel communication of the program occurred.
Definition exceptions.hh:287
Definition communication.hh:46
Collective communication interface and sequential default implementation.
Definition communication.hh:100
PseudoFuture< TOUT > iallreduce(TIN &&data_in, TOUT &&data_out)
Compute something over all processes nonblocking.
Definition communication.hh:496
int send(const T &data, int dest_rank, int tag)
Sends the data to the dest_rank.
Definition communication.hh:135
int allreduce(const Type *in, Type *out, int len) const
Compute something over all processes for each component of an array and return the result in every pr...
Definition communication.hh:525
T max(const T &in) const
Compute the maximum of the argument over all processes and return the result in every process....
Definition communication.hh:248
int rank() const
Return rank, is between 0 and size()-1.
Definition communication.hh:114
T sum(const T &in) const
Compute the sum of the argument over all processes and return the result in every process....
Definition communication.hh:188
int scatterv(const T *sendData, int *sendDataLen, int *displ, T *recvData, int recvDataLen, int root) const
Scatter arrays of variable length from a root to all other tasks.
Definition communication.hh:411
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 ...
Definition communication.hh:219
T recv(T &&data, int source_rank, int tag, void *status=0)
Receives the data from the source_rank.
Definition communication.hh:157
PseudoFuture< T > isend(const T &&data, int dest_rank, int tag)
Sends the data to the dest_rank nonblocking.
Definition communication.hh:146
PseudoFuture< void > ibarrier() const
Nonblocking barrier.
Definition communication.hh:275
int allreduce(Type *inout, int len) const
Compute something over all processes for each component of an array and return the result in every pr...
Definition communication.hh:486
int size() const
Number of processes in set, is greater than 0.
Definition communication.hh:126
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 proc...
Definition communication.hh:199
int allgatherv(const T *in, int sendDataLen, T *out, int *recvDataLen, int *displ) const
Gathers data of variable length from all tasks and distribute it to all.
Definition communication.hh:466
T min(const T &in) const
Compute the minimum of the argument over all processes and return the result in every process....
Definition communication.hh:228
PseudoFuture< T > irecv(T &&data, int source_rank, int tag)
Receives the data from the source_rank nonblocking.
Definition communication.hh:169
int gatherv(const T *in, int sendDataLen, T *out, int *recvDataLen, int *displ, int root) const
Gather arrays of variable size on root task.
Definition communication.hh:350
PseudoFuture< T > ibroadcast(T &&data, int root) const
Distribute an array from the process with rank root to all other processes nonblocking.
Definition communication.hh:295
int allgather(const T *sbuf, int count, T *rbuf) const
Gathers data from all tasks and distribute it to all.
Definition communication.hh:433
int scatter(const T *sendData, T *recvData, int len, int root) const
Scatter array from a root to all other task.
Definition communication.hh:376
int gather(const T *in, T *out, int len, int root) const
Gather arrays on root task.
Definition communication.hh:313
PseudoFuture< T > iallreduce(T &&data)
Compute something over all processes nonblocking and in-place.
Definition communication.hh:506
Communication(const Communicator &)
Constructor with a given communicator.
Definition communication.hh:110
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 ...
Definition communication.hh:259
T prod(const T &in) const
Compute the product of the argument over all processes and return the result in every process....
Definition communication.hh:208
int broadcast(T *inout, int len, int root) const
Distribute an array from the process with rank root to all other processes.
Definition communication.hh:284
T rrecv(T &&data, int source_rank, int tag, void *status=0) const
Definition communication.hh:177
PseudoFuture< TOUT > iscatter(TIN &&data_in, TOUT &&data_out, int root)
Scatter array from a root to all other task nonblocking.
Definition communication.hh:387
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 ...
Definition communication.hh:239
int barrier() const
Wait until all processes have arrived at this point in the program.
Definition communication.hh:267
PseudoFuture< TOUT > igather(TIN &&data_in, TOUT &&data_out, int root)
Gather arrays on root task nonblocking.
Definition communication.hh:324
PseudoFuture< TOUT > iallgather(TIN &&data_in, TOUT &&data_out)
Gathers data from all tasks and distribute it to all nonblocking.
Definition communication.hh:445
Communication()
Construct default object.
Definition communication.hh:103