A dimension minimum location schedule is a communication schedule for searching for the smallest elements of a distributed array along one of its dimensions, yielding a reduced array with rank one less than the source.
A dimension minimum location schedule is described by a collective object with local components of class MinlocDim. The public interface of the MinlocDim class is
class DAD ;
template<class T>
class MinlocDim {
public :
MinlocDim(const DAD* val, const DAD* pos,
const DAD* src, const int dim) ;
void execute(T* valDat, int* posDat, T* srcDat) ;
private :
...
} ;