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