View Javadoc
1   // ******************************************************************************
2   //
3   // Title:       Force Field X.
4   // Description: Force Field X - Software for Molecular Biophysics.
5   // Copyright:   Copyright (c) Michael J. Schnieders 2001-2024.
6   //
7   // This file is part of Force Field X.
8   //
9   // Force Field X is free software; you can redistribute it and/or modify it
10  // under the terms of the GNU General Public License version 3 as published by
11  // the Free Software Foundation.
12  //
13  // Force Field X is distributed in the hope that it will be useful, but WITHOUT
14  // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
15  // FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
16  // details.
17  //
18  // You should have received a copy of the GNU General Public License along with
19  // Force Field X; if not, write to the Free Software Foundation, Inc., 59 Temple
20  // Place, Suite 330, Boston, MA 02111-1307 USA
21  //
22  // Linking this library statically or dynamically with other modules is making a
23  // combined work based on this library. Thus, the terms and conditions of the
24  // GNU General Public License cover the whole combination.
25  //
26  // As a special exception, the copyright holders of this library give you
27  // permission to link this library with independent modules to produce an
28  // executable, regardless of the license terms of these independent modules, and
29  // to copy and distribute the resulting executable under terms of your choice,
30  // provided that you also meet, for each linked independent module, the terms
31  // and conditions of the license of that module. An independent module is a
32  // module which is not derived from or based on this library. If you modify this
33  // library, you may extend this exception to your version of the library, but
34  // you are not obligated to do so. If you do not wish to do so, delete this
35  // exception statement from your version.
36  //
37  // ******************************************************************************
38  package ffx.numerics.atomic;
39  
40  import edu.rit.pj.IntegerForLoop;
41  import edu.rit.pj.ParallelRegion;
42  import edu.rit.pj.ParallelTeam;
43  import java.util.concurrent.atomic.DoubleAdder;
44  import java.util.logging.Level;
45  import java.util.logging.Logger;
46  
47  /**
48   * AdderDoubleArray implements the AtomicDoubleArray interface using an array of <code>
49   * java.util.concurrent.atomic.DoubleAdder</code>.
50   *
51   * @author Michael J. Schnieders
52   * @since 1.0
53   */
54  public class AdderDoubleArray implements AtomicDoubleArray {
55  
56    private static final Logger logger = Logger.getLogger(AdderDoubleArray.class.getName());
57  
58    /** Atomic operations are handled by an Array of DoubleAdder instances. */
59    private DoubleAdder[] array;
60  
61    private int size;
62  
63    /**
64     * Construct an AdderDoubleArray.
65     *
66     * @param size Size of the array.
67     */
68    public AdderDoubleArray(int size) {
69      this.size = size;
70      array = new DoubleAdder[size];
71      for (int i = 0; i < size; i++) {
72        array[i] = new DoubleAdder();
73      }
74    }
75  
76    /** {@inheritDoc} */
77    @Override
78    public void add(int threadID, int index, double value) {
79      array[index].add(value);
80    }
81  
82    /** {@inheritDoc} */
83    @Override
84    public void alloc(int size) {
85      this.size = size;
86      if (array.length < size) {
87        array = new DoubleAdder[size];
88        for (int i = 0; i < size; i++) {
89          array[i] = new DoubleAdder();
90        }
91      }
92    }
93  
94    /** {@inheritDoc} */
95    @Override
96    public double get(int index) {
97      return array[index].sum();
98    }
99  
100   /**
101    * The AtomicDoubleArray handles the reduction automatically, so this method does nothing.
102    */
103   @Override
104   public void reduce(int lb, int ub) {
105     // Nothing to do.
106   }
107 
108   /**
109    * The AtomicDoubleArray handles the reduction automatically, so this method does nothing.
110    */
111   @Override
112   public void reduce(ParallelTeam parallelTeam, int lb, int ub) {
113     // Nothing to do.
114   }
115 
116   /** {@inheritDoc} */
117   @Override
118   public void reset(int threadID, int lb, int ub) {
119     for (int i = lb; i <= ub; i++) {
120       array[i].reset();
121       array[i].add(0.0);
122     }
123   }
124 
125   /** {@inheritDoc} */
126   @Override
127   public void reset(ParallelTeam parallelTeam, int lb, int ub) {
128     try {
129       parallelTeam.execute(
130           new ParallelRegion() {
131             @Override
132             public void run() throws Exception {
133               execute(
134                   lb,
135                   ub,
136                   new IntegerForLoop() {
137                     @Override
138                     public void run(int first, int last) {
139                       reset(getThreadIndex(), first, last);
140                     }
141                   });
142             }
143           });
144     } catch (Exception e) {
145       logger.log(Level.WARNING, " Exception resetting an AdderDoubleArray", e);
146     }
147   }
148 
149   /** {@inheritDoc} */
150   @Override
151   public void scale(int threadID, int index, double value) {
152     double current = array[index].sumThenReset();
153     array[index].add(current * value);
154   }
155 
156   /** {@inheritDoc} */
157   @Override
158   public void set(int threadID, int index, double value) {
159     array[index].reset();
160     array[index].add(value);
161   }
162 
163   /** {@inheritDoc} */
164   @Override
165   public int size() {
166     return size;
167   }
168 
169   /** {@inheritDoc} */
170   @Override
171   public void sub(int threadID, int index, double value) {
172     array[index].add(-value);
173   }
174 }