A masked minimum schedule is a communication schedule for finding the smallest element of a distributed array (the source array) under the control of a mask array. A masked minimum schedule is described by a collective object with local components of class MinvalMsk. The public interface of the MinvalMsk class is
class DAD ;
template<class T>
class MinvalMsk {
public :
MinvalMsk(const DAD* src, const DAD* msk) ;
void execute(T* res, T* srcDat, int* mskDat) ;
private :
...
} ;