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