src/parallel/ForceDecomposition.hpp

/*
 * Copyright (c) 2011 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).          
 * [4]  Vardeman & Gezelter, in progress (2009).                        
 */
 
#ifndef PARALLEL_FORCEDECOMPOSITION_HPP
#define PARALLEL_FORCEDECOMPOSITION_HPP

#include "brains/SimInfo.hpp"
#include "brains/SnapshotManager.hpp"
#include "nonbonded/NonBondedInteraction.hpp"
#include "nonbonded/Cutoffs.hpp"
#include "nonbonded/InteractionManager.hpp"
#include "utils/Tuple.hpp"

using namespace std;
namespace OpenMD {
  
  typedef tuple3<RealType, RealType, RealType> groupCutoffs;

  /**
   * @class ForceDecomposition 
   *
   * ForceDecomposition is an interface for passing out and collecting
   * information from many processors at various stages of the main
   * non-bonded ForceLoop.
   *
   * The pairwise force calculation has an outer-running loop (the "I"
   * loop) and an inner-running loop (the "J" loop).  In parallel
   * decompositions, these loop over different groups of atoms on
   * different processors.  Between each set of computations on the
   * local processor, data must be exchanged among the processors.
   * This can happen at different times in the calculation:
   *
   *  distributeInitialData      (parallel communication - one time only)
   *  distributeData             (parallel communication - every ForceLoop)
   *
   *  loop iLoop over nLoops     (nLoops may be 1, 2, or until self consistent)
   *  |  loop over i
   *  |  | loop over j
   *  |  | | localComputation
   *  |  |  end
   *  |  end
   *  |  if (nLoops > 1):
   *  |  |   collectIntermediateData    (parallel communication)
   *  |  |   distributeIntermediateData (parallel communication)
   *  |  endif
   *  end
   * collectData                        (parallel communication)
   *
   * ForceDecomposition provides the interface for ForceLoop to do the
   * communication steps and to iterate using the correct set of atoms
   * and cutoff groups.
   */
  class ForceDecomposition {
  public:

    ForceDecomposition(SimInfo* info, InteractionManager* iMan);
    virtual ~ForceDecomposition() {}
    
    virtual void distributeInitialData() = 0;
    virtual void distributeData() = 0;
    virtual void zeroWorkArrays() = 0;
    virtual void collectIntermediateData() = 0;
    virtual void distributeIntermediateData() = 0;
    virtual void collectData() = 0;
    virtual potVec* getEmbeddingPotential() { return &embeddingPot; }
    virtual potVec* getPairwisePotential() { return &pairwisePot; }

    // neighbor list routines
    virtual bool checkNeighborList();
    virtual vector<pair<int, int> >  buildNeighborList() = 0;

    // how to handle cutoffs:
    void setCutoffPolicy(CutoffPolicy cp) {cutoffPolicy_ = cp;}
    void setUserCutoff(RealType rcut) {userCutoff_ = rcut; userChoseCutoff_ = true; }

    // group bookkeeping
    virtual groupCutoffs getGroupCutoffs(int cg1, int cg2) = 0;

    // Group->atom bookkeeping
    virtual vector<int> getAtomsInGroupRow(int cg1) = 0; 
    virtual vector<int> getAtomsInGroupColumn(int cg2) = 0;

    virtual Vector3d getAtomToGroupVectorRow(int atom1, int cg1) = 0;
    virtual Vector3d getAtomToGroupVectorColumn(int atom2, int cg2) = 0;
    virtual RealType getMassFactorRow(int atom1) = 0;
    virtual RealType getMassFactorColumn(int atom2) = 0;

    // spatial data
    virtual Vector3d getIntergroupVector(int cg1, int cg2) = 0;
    virtual Vector3d getInteratomicVector(int atom1, int atom2) = 0;
       
    // atom bookkeeping
    virtual int getNAtomsInRow() = 0;
    virtual vector<int> getExcludesForAtom(int atom1) = 0;
    virtual bool skipAtomPair(int atom1, int atom2) = 0;
    virtual bool excludeAtomPair(int atom1, int atom2) = 0;
    virtual int getTopologicalDistance(int atom1, int atom2) = 0;
    virtual void addForceToAtomRow(int atom1, Vector3d fg) = 0;
    virtual void addForceToAtomColumn(int atom2, Vector3d fg) = 0;


    // filling interaction blocks with pointers
    virtual void fillInteractionData(InteractionData &idat, int atom1, int atom2) = 0;
    virtual void unpackInteractionData(InteractionData &idat, int atom1, int atom2) = 0;

    virtual void fillSelfData(SelfData &sdat, int atom1);
    
  protected:
    SimInfo* info_;   
    SnapshotManager* sman_;    
    Snapshot* snap_;
    ForceField* ff_;
    InteractionManager* interactionMan_;

    int storageLayout_;
    RealType skinThickness_;   /**< Verlet neighbor list skin thickness */    
    RealType largestRcut_;

    vector<int> idents;
    potVec pairwisePot;
    potVec embeddingPot;

    /** 
     * The topological distance between two atomic sites is handled
     * via two vector structures for speed.  These structures agnostic
     * regarding the parallel decomposition.  The index for
     * toposForAtom could be local or row, while the values could be
     * local or column.  It will be up to the specific decomposition
     * method to fill these.
     */
    vector<vector<int> > toposForAtom; 
    vector<vector<int> > topoDist;                                       
    vector<vector<int> > excludesForAtom;
    vector<vector<int> > groupList_;
    vector<RealType> massFactors;
    vector<AtomType*> atypesLocal;

    vector<Vector3i> cellOffsets_;
    Vector3i nCells_;
    vector<vector<int> > cellList_;
    vector<Vector3d> saved_CG_positions_;

    bool userChoseCutoff_;
    RealType userCutoff_;
    CutoffPolicy cutoffPolicy_;

    map<pair<int, int>, tuple3<RealType, RealType, RealType> > gTypeCutoffMap;

  };    
}
#endif
Revision:	1591
Committed:	Tue Jul 12 15:25:07 2011 UTC (13 years, 9 months ago) by gezelter
File size:	7461 byte(s)
Log Message:	Efficiency fix
#	User	Rev	Content
1	gezelter	1539	/*
2	gezelter	1549	* Copyright (c) 2011 The University of Notre Dame. All Rights Reserved.
3	gezelter	1539	*
4			* The University of Notre Dame grants you ("Licensee") a
5			* non-exclusive, royalty free, license to use, modify and
6			* redistribute this software in source and binary code form, provided
7			* that the following conditions are met:
8			*
9			* 1. Redistributions of source code must retain the above copyright
10			* notice, this list of conditions and the following disclaimer.
11			*
12			* 2. Redistributions in binary form must reproduce the above copyright
13			* notice, this list of conditions and the following disclaimer in the
14			* documentation and/or other materials provided with the
15			* distribution.
16			*
17			* This software is provided "AS IS," without a warranty of any
18			* kind. All express or implied conditions, representations and
19			* warranties, including any implied warranty of merchantability,
20			* fitness for a particular purpose or non-infringement, are hereby
21			* excluded. The University of Notre Dame and its licensors shall not
22			* be liable for any damages suffered by licensee as a result of
23			* using, modifying or distributing the software or its
24			* derivatives. In no event will the University of Notre Dame or its
25			* licensors be liable for any lost revenue, profit or data, or for
26			* direct, indirect, special, consequential, incidental or punitive
27			* damages, however caused and regardless of the theory of liability,
28			* arising out of the use of or inability to use software, even if the
29			* University of Notre Dame has been advised of the possibility of
30			* such damages.
31			*
32			* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your
33			* research, please cite the appropriate papers when you publish your
34			* work. Good starting points are:
35			*
36			* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).
37			* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).
38			* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).
39			* [4] Vardeman & Gezelter, in progress (2009).
40			*/
41
42	gezelter	1549	#ifndef PARALLEL_FORCEDECOMPOSITION_HPP
43			#define PARALLEL_FORCEDECOMPOSITION_HPP
44	gezelter	1539
45	gezelter	1544	#include "brains/SimInfo.hpp"
46	gezelter	1568	#include "brains/SnapshotManager.hpp"
47	gezelter	1545	#include "nonbonded/NonBondedInteraction.hpp"
48	gezelter	1576	#include "nonbonded/Cutoffs.hpp"
49			#include "nonbonded/InteractionManager.hpp"
50			#include "utils/Tuple.hpp"
51	gezelter	1539
52			using namespace std;
53			namespace OpenMD {
54
55	gezelter	1576	typedef tuple3<RealType, RealType, RealType> groupCutoffs;
56
57	gezelter	1539	/**
58	gezelter	1549	* @class ForceDecomposition
59	gezelter	1539	*
60	gezelter	1549	* ForceDecomposition is an interface for passing out and collecting
61			* information from many processors at various stages of the main
62			* non-bonded ForceLoop.
63			*
64	gezelter	1539	* The pairwise force calculation has an outer-running loop (the "I"
65			* loop) and an inner-running loop (the "J" loop). In parallel
66			* decompositions, these loop over different groups of atoms on
67			* different processors. Between each set of computations on the
68			* local processor, data must be exchanged among the processors.
69			* This can happen at different times in the calculation:
70			*
71			* distributeInitialData (parallel communication - one time only)
72			* distributeData (parallel communication - every ForceLoop)
73	gezelter	1544	*
74			* loop iLoop over nLoops (nLoops may be 1, 2, or until self consistent)
75			* \| loop over i
76			* \| \| loop over j
77			* \| \| \| localComputation
78			* \| \| end
79	gezelter	1539	* \| end
80	gezelter	1544	* \| if (nLoops > 1):
81			* \| \| collectIntermediateData (parallel communication)
82			* \| \| distributeIntermediateData (parallel communication)
83			* \| endif
84	gezelter	1539	* end
85	gezelter	1544	* collectData (parallel communication)
86	gezelter	1539	*
87	gezelter	1549	* ForceDecomposition provides the interface for ForceLoop to do the
88	gezelter	1539	* communication steps and to iterate using the correct set of atoms
89			* and cutoff groups.
90			*/
91	gezelter	1549	class ForceDecomposition {
92	gezelter	1539	public:
93
94	gezelter	1579	ForceDecomposition(SimInfo* info, InteractionManager* iMan);
95	gezelter	1549	virtual ~ForceDecomposition() {}
96	gezelter	1539
97			virtual void distributeInitialData() = 0;
98			virtual void distributeData() = 0;
99	gezelter	1575	virtual void zeroWorkArrays() = 0;
100	gezelter	1539	virtual void collectIntermediateData() = 0;
101			virtual void distributeIntermediateData() = 0;
102			virtual void collectData() = 0;
103	gezelter	1583	virtual potVec* getEmbeddingPotential() { return &embeddingPot; }
104			virtual potVec* getPairwisePotential() { return &pairwisePot; }
105	gezelter	1539
106	gezelter	1545	// neighbor list routines
107	gezelter	1568	virtual bool checkNeighborList();
108	gezelter	1545	virtual vector<pair<int, int> > buildNeighborList() = 0;
109	gezelter	1539
110	gezelter	1576	// how to handle cutoffs:
111			void setCutoffPolicy(CutoffPolicy cp) {cutoffPolicy_ = cp;}
112			void setUserCutoff(RealType rcut) {userCutoff_ = rcut; userChoseCutoff_ = true; }
113
114	gezelter	1545	// group bookkeeping
115	gezelter	1576	virtual groupCutoffs getGroupCutoffs(int cg1, int cg2) = 0;
116	gezelter	1539
117	gezelter	1545	// Group->atom bookkeeping
118	gezelter	1569	virtual vector<int> getAtomsInGroupRow(int cg1) = 0;
119	gezelter	1549	virtual vector<int> getAtomsInGroupColumn(int cg2) = 0;
120	gezelter	1569
121	gezelter	1549	virtual Vector3d getAtomToGroupVectorRow(int atom1, int cg1) = 0;
122			virtual Vector3d getAtomToGroupVectorColumn(int atom2, int cg2) = 0;
123	gezelter	1569	virtual RealType getMassFactorRow(int atom1) = 0;
124			virtual RealType getMassFactorColumn(int atom2) = 0;
125	gezelter	1545
126			// spatial data
127			virtual Vector3d getIntergroupVector(int cg1, int cg2) = 0;
128			virtual Vector3d getInteratomicVector(int atom1, int atom2) = 0;
129
130			// atom bookkeeping
131	gezelter	1570	virtual int getNAtomsInRow() = 0;
132	gezelter	1587	virtual vector<int> getExcludesForAtom(int atom1) = 0;
133	gezelter	1545	virtual bool skipAtomPair(int atom1, int atom2) = 0;
134	gezelter	1587	virtual bool excludeAtomPair(int atom1, int atom2) = 0;
135			virtual int getTopologicalDistance(int atom1, int atom2) = 0;
136	gezelter	1549	virtual void addForceToAtomRow(int atom1, Vector3d fg) = 0;
137			virtual void addForceToAtomColumn(int atom2, Vector3d fg) = 0;
138	gezelter	1545
139	gezelter	1587
140	gezelter	1545	// filling interaction blocks with pointers
141	gezelter	1582	virtual void fillInteractionData(InteractionData &idat, int atom1, int atom2) = 0;
142			virtual void unpackInteractionData(InteractionData &idat, int atom1, int atom2) = 0;
143	gezelter	1583
144	gezelter	1582	virtual void fillSelfData(SelfData &sdat, int atom1);
145	gezelter	1539
146			protected:
147	gezelter	1544	SimInfo* info_;
148	gezelter	1568	SnapshotManager* sman_;
149			Snapshot* snap_;
150	gezelter	1571	ForceField* ff_;
151	gezelter	1576	InteractionManager* interactionMan_;
152
153	gezelter	1568	int storageLayout_;
154			RealType skinThickness_; /*< Verlet neighbor list skin thickness /
155	gezelter	1576	RealType largestRcut_;
156	gezelter	1568
157	gezelter	1583	vector<int> idents;
158			potVec pairwisePot;
159			potVec embeddingPot;
160
161	gezelter	1579	/**
162			* The topological distance between two atomic sites is handled
163			* via two vector structures for speed. These structures agnostic
164			* regarding the parallel decomposition. The index for
165			* toposForAtom could be local or row, while the values could be
166			* local or column. It will be up to the specific decomposition
167			* method to fill these.
168			*/
169			vector<vector<int> > toposForAtom;
170	gezelter	1581	vector<vector<int> > topoDist;
171	gezelter	1587	vector<vector<int> > excludesForAtom;
172	gezelter	1569	vector<vector<int> > groupList_;
173	gezelter	1581	vector<RealType> massFactors;
174	gezelter	1591	vector<AtomType*> atypesLocal;
175	gezelter	1576
176	gezelter	1562	vector<Vector3i> cellOffsets_;
177	gezelter	1568	Vector3i nCells_;
178			vector<vector<int> > cellList_;
179			vector<Vector3d> saved_CG_positions_;
180
181	gezelter	1576	bool userChoseCutoff_;
182			RealType userCutoff_;
183			CutoffPolicy cutoffPolicy_;
184
185			map<pair<int, int>, tuple3<RealType, RealType, RealType> > gTypeCutoffMap;
186
187	gezelter	1539	};
188			}
189			#endif