ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/group/trunk/OOPSE-4/src/brains/BlockSnapshotManager.cpp
Revision: 3324
Committed: Wed Jan 23 21:22:37 2008 UTC (17 years, 3 months ago) by xsun
File size: 9347 byte(s)
Log Message:
fixed printing of memory available

File Contents

# Content
1 /*
2 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
3 *
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. Acknowledgement of the program authors must be made in any
10 * publication of scientific results based in part on use of the
11 * program. An acceptable form of acknowledgement is citation of
12 * the article in which the program was described (Matthew
13 * A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
14 * J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
15 * Parallel Simulation Engine for Molecular Dynamics,"
16 * J. Comput. Chem. 26, pp. 252-271 (2005))
17 *
18 * 2. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 *
21 * 3. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the
24 * distribution.
25 *
26 * This software is provided "AS IS," without a warranty of any
27 * kind. All express or implied conditions, representations and
28 * warranties, including any implied warranty of merchantability,
29 * fitness for a particular purpose or non-infringement, are hereby
30 * excluded. The University of Notre Dame and its licensors shall not
31 * be liable for any damages suffered by licensee as a result of
32 * using, modifying or distributing the software or its
33 * derivatives. In no event will the University of Notre Dame or its
34 * licensors be liable for any lost revenue, profit or data, or for
35 * direct, indirect, special, consequential, incidental or punitive
36 * damages, however caused and regardless of the theory of liability,
37 * arising out of the use of or inability to use software, even if the
38 * University of Notre Dame has been advised of the possibility of
39 * such damages.
40 */
41 #include <algorithm>
42 #include "brains/BlockSnapshotManager.hpp"
43 #include "utils/residentMem.h"
44 #include "utils/physmem.h"
45 #include "utils/Algorithm.hpp"
46 #include "brains/SimInfo.hpp"
47 #include "io/DumpReader.hpp"
48
49 namespace oopse {
50 BlockSnapshotManager::BlockSnapshotManager(SimInfo* info, const std::string& filename,
51 int storageLayout, int blockCapacity)
52 : SnapshotManager(storageLayout), info_(info), blockCapacity_(blockCapacity),
53 activeBlocks_(blockCapacity_, -1), activeRefCount_(blockCapacity_, 0) {
54
55 nAtoms_ = info->getNGlobalAtoms();
56 nRigidBodies_ = info->getNGlobalRigidBodies();
57
58 RealType physMem = physmem_total();
59 RealType rssMem = residentMem();
60 RealType avaliablePhysMem = physMem - rssMem;
61
62
63 int bytesPerStuntDouble = DataStorage::getBytesPerStuntDouble(storageLayout);
64
65 int bytesPerFrame = (nRigidBodies_ + nAtoms_) * bytesPerStuntDouble;
66
67 // total number of frames that can fit in memory
68 RealType frameCapacity = avaliablePhysMem / bytesPerFrame;
69
70 // number of frames in each block given the need to hold multiple blocks
71 // in memory at the same time:
72 nSnapshotPerBlock_ = int(frameCapacity) / blockCapacity_;
73 reader_ = new DumpReader(info, filename);
74 nframes_ = reader_->getNFrames();
75 int nblocks = nframes_ / nSnapshotPerBlock_;
76 if (nframes_ % int(nSnapshotPerBlock_) != 0) {
77 ++nblocks;
78 }
79
80 for (int i = 0; i < nblocks; ++i) {
81 blocks_.push_back(SnapshotBlock(i*nSnapshotPerBlock_, (i+1)*nSnapshotPerBlock_));
82 }
83 //the last block may not have nSnapshotPerBlock frames, we need to consider this special situation
84 blocks_.back().second = nframes_;
85
86 snapshots_.insert(snapshots_.begin(), nframes_, static_cast<Snapshot*>(NULL));
87
88 std::cout << "-----------------------------------------------------"<<std::endl;
89 std::cout << "BlockSnapshotManager memory report:" << std::endl;
90 std::cout << "\n";
91 std::cout << " Physical Memory available:\t" << (unsigned long)physMem << " bytes" <<std::endl;
92 std::cout << " Resident Memory in use:\t" << (unsigned long)rssMem << " bytes" <<std::endl;
93 std::cout << "Memory available for OOPSE:\t" << (unsigned long)avaliablePhysMem << " bytes" <<std::endl;
94 std::cout << " Bytes per StuntDouble:\t" << (unsigned long)bytesPerStuntDouble <<std::endl;
95 std::cout << " Bytes per Frame:\t" << (unsigned long)bytesPerFrame <<std::endl;
96 std::cout << " Frame Capacity:\t" << (unsigned long)frameCapacity <<std::endl;
97 std::cout << " Frames in trajectory:\t" << (unsigned long)nframes_ <<std::endl;
98 std::cout << " Snapshots per Block:\t" << (unsigned long)nSnapshotPerBlock_ <<std::endl;
99 std::cout << " Total number of Blocks:\t" << (unsigned long)nblocks << std::endl;
100 std::cout << "-----------------------------------------------------"<<std::endl;
101
102 }
103
104
105 BlockSnapshotManager::~BlockSnapshotManager() {
106 currentSnapshot_ = NULL;
107 previousSnapshot_ = NULL;
108
109 delete reader_;
110
111 std::vector<int>::iterator i;
112 for (i = activeBlocks_.begin(); i != activeBlocks_.end(); ++i) {
113 if (*i != -1) {
114 unloadBlock(*i);
115 }
116 }
117 }
118
119
120 // virtual Snapshot* BlockSnapshotManager::getSnapshot(int id) {
121 // currentSnapshot_ = snapshots[id];
122 // return snapshots_[id];
123 //}
124
125 int BlockSnapshotManager::getNActiveBlocks() {
126 #ifdef __RWSTD
127 int count = 0;
128 std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1), count);
129 return count;
130 #else
131 return std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1));
132 #endif
133 }
134
135
136
137 bool BlockSnapshotManager::loadBlock(int block) {
138 std::vector<int>::iterator i = findActiveBlock(block);
139 bool loadSuccess;
140 if (i != activeBlocks_.end()) {
141 //if block is already in memory, just increast the reference count
142 ++activeRefCount_[i - activeBlocks_.begin()];
143 loadSuccess = true;
144 } else if (getNActiveBlocks() < blockCapacity_){
145 //if number of active blocks is less than the block capacity, just load it
146 internalLoad(block);
147 loadSuccess = true;
148 } else if (hasZeroRefBlock() > 0) {
149 //if already reach the block capacity, need to unload a block with 0 reference
150 int zeroRefBlock = getFirstZeroRefBlock();
151 assert(zeroRefBlock != -1);
152 internalUnload(zeroRefBlock);
153 internalLoad(block);
154 } else {
155 //reach the capacity and all blocks in memory are not zero reference
156 loadSuccess = false;
157 }
158
159 return loadSuccess;
160 }
161
162 bool BlockSnapshotManager::unloadBlock(int block) {
163 bool unloadSuccess;
164 std::vector<int>::iterator i = findActiveBlock(block);
165
166 if (i != activeBlocks_.end()){
167 --activeRefCount_[i - activeBlocks_.begin()];
168 if (activeRefCount_[i - activeBlocks_.begin()] < 0) {
169 //in case, unloadBlock called multiple times
170 activeRefCount_[i - activeBlocks_.begin()] = 0;
171 }
172
173 unloadSuccess = true;
174 } else {
175 unloadSuccess = false;
176 }
177
178 return unloadSuccess;
179 }
180
181 void BlockSnapshotManager::internalLoad(int block) {
182
183 for (int i = blocks_[block].first; i < blocks_[block].second; ++i) {
184 snapshots_[i] = loadFrame(i);
185 }
186
187 std::vector<int>::iterator j;
188 j = std::find(activeBlocks_.begin(), activeBlocks_.end(), -1);
189 assert(j != activeBlocks_.end());
190 *j = block;
191 ++activeRefCount_[j - activeBlocks_.begin()];
192 }
193
194 void BlockSnapshotManager::internalUnload(int block) {
195 for (int i = blocks_[block].first; i < blocks_[block].second; ++i) {
196 delete snapshots_[i];
197 snapshots_[i] = NULL;
198 }
199 std::vector<int>::iterator j;
200 j = std::find(activeBlocks_.begin(), activeBlocks_.end(), block);
201 assert(j != activeBlocks_.end());
202 *j = -1;
203 }
204
205 bool BlockSnapshotManager::hasZeroRefBlock(){
206 return std::find(activeRefCount_.begin(), activeRefCount_.end(), 0) != activeRefCount_.end() ? true : false;
207 }
208
209 int BlockSnapshotManager::getFirstZeroRefBlock(){
210 std::vector<int>::iterator i = std::find(activeRefCount_.begin(), activeRefCount_.end(), 0);
211 return i != activeRefCount_.end() ? activeBlocks_[i - activeRefCount_.begin()] : -1;
212 }
213
214 std::vector<int> BlockSnapshotManager::getActiveBlocks() {
215 std::vector<int> result;
216 oopse::copy_if(activeBlocks_.begin(), activeBlocks_.end(), std::back_inserter(result),
217 std::bind2nd(std::not_equal_to<int>(), -1));
218 return result;
219 }
220
221 Snapshot* BlockSnapshotManager::loadFrame(int frame){
222 Snapshot* snapshot = new Snapshot(nAtoms_, nRigidBodies_, getStorageLayout());
223 snapshot->setID(frame);
224
225 /** @todo fixed me */
226 Snapshot* oldSnapshot = currentSnapshot_;
227 currentSnapshot_ = snapshot;
228 reader_->readFrame(frame);
229
230 // What was this for? It doesn't make sense!
231 //currentSnapshot_ = oldSnapshot;
232
233 return snapshot;
234 }
235
236 int BlockSnapshotManager::getNFrames() {
237 return reader_->getNFrames();
238 }
239
240 void BlockSnapshotManager::needCOMprops(bool ncp) {
241 reader_->setNeedCOMprops(ncp);
242 }
243
244 }