next up previous contents
Next: Constructor Up: Communication schedules Previous: Overlap restrictions:

 

class Shift

A shift schedule is a communication schedule for shifting the elements of a distributed array along one of its dimensions, placing the result in another array. The source and destination have the same shape and same element-type, and they must have a certain alignment relation.

A shift schedule is described by a collective object with local components of class Shift. The public interface of the Shift class is

  class DAD ;
  enum Mode {CYCL, EDGE, NONE} ;

  class Shift {
  public :
    Shift(const DAD* dst, const DAD* src, const int len,
          const int shift, const int dim, const Mode mode) ;

    void execute(void* dstDat, void* srcDat) ;
  private :
    ...
  } ;





Guansong Zhang
Fri Oct 9 12:29:23 EDT 1998