src/brains/BlockSnapshotManager.cpp

/*
 * Copyright (c) 2005 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. Acknowledgement of the program authors must be made in any
 *    publication of scientific results based in part on use of the
 *    program.  An acceptable form of acknowledgement is citation of
 *    the article in which the program was described (Matthew
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
 *    Parallel Simulation Engine for Molecular Dynamics,"
 *    J. Comput. Chem. 26, pp. 252-271 (2005))
 *
 * 2. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 3. 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.
 */
#include <algorithm>
#include "brains/BlockSnapshotManager.hpp"
#include "utils/residentMem.h"
#include "utils/physmem.h"
#include "utils/Algorithm.hpp"
#include "brains/SimInfo.hpp"
#include "io/DumpReader.hpp"

namespace oopse {
BlockSnapshotManager::BlockSnapshotManager(SimInfo* info, const std::string& filename, 
    int storageLayout, int blockCapacity) 
    : SnapshotManager(storageLayout), info_(info), blockCapacity_(blockCapacity), 
      activeBlocks_(blockCapacity_, -1), activeRefCount_(blockCapacity_, 0) {

    nAtoms_ = info->getNGlobalAtoms();
    nRigidBodies_ = info->getNGlobalRigidBodies();

    double physMem = physmem_total();
    double avalPhysMem = physmem_available();
    double rssMem = residentMem();

    std::cout << "physmem = " << physMem << "\t availablePhysMem = " << avalPhysMem << "\trssMem =  "<< rssMem<<std::endl;
    int bytesPerStuntDouble = DataStorage::getBytesPerStuntDouble(storageLayout);

    int bytesPerFrame = (nRigidBodies_ + nAtoms_) * bytesPerStuntDouble;

    int frameCapacity = int (rssMem / bytesPerFrame);
    
    nSnapshotPerBlock_ = frameCapacity /blockCapacity_ ;

    reader_ = new DumpReader(info, filename);
    nframes_ = reader_->getNFrames();

    int nblocks = nframes_ / nSnapshotPerBlock_;
    if (nframes_ % nSnapshotPerBlock_ != 0) {
        ++nblocks;
    }  
    
    for (int i = 0; i < nblocks; ++i) {
        blocks_.push_back(SnapshotBlock(i*nSnapshotPerBlock_, (i+1)*nSnapshotPerBlock_));    
    }
    //the last block may not have nSnapshotPerBlock frames, we need to consider this special situation
    blocks_.back().second = nframes_;

    snapshots_.insert(snapshots_.begin(), nframes_, static_cast<Snapshot*>(NULL));   
    
}


BlockSnapshotManager::~BlockSnapshotManager() {
    currentSnapshot_ = NULL;
    previousSnapshot_ = NULL;
    
    delete reader_;

    std::vector<int>::iterator i;
    for (i = activeBlocks_.begin(); i != activeBlocks_.end(); ++i) {
        if (*i != -1) {
            unloadBlock(*i);
        }
    }
}

int BlockSnapshotManager::getNActiveBlocks() {
#ifdef __RWSTD   
    int count = 0;
    std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1), count);
    return count;
#else
    return std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1));
#endif
}


bool BlockSnapshotManager::loadBlock(int block) {
    std::vector<int>::iterator i = findActiveBlock(block);
    bool loadSuccess;
    if (i != activeBlocks_.end()) {
        //if block is already in memory, just increast the reference count
        ++activeRefCount_[i - activeBlocks_.begin()];
        loadSuccess = true;
    } else if (getNActiveBlocks() < blockCapacity_){
        //if number of active blocks is less than the block capacity, just load it
        internalLoad(block);
        loadSuccess = true;
    } else if (hasZeroRefBlock() > 0) {
        //if already reach the block capacity, need to unload a block with 0 reference
        int zeroRefBlock = getFirstZeroRefBlock();
        assert(zeroRefBlock != -1);
        internalUnload(zeroRefBlock);
        internalLoad(block);
    } else {
        //reach the capacity and all blocks in memory are not zero reference
        loadSuccess = false;
    }
    
    return loadSuccess;
}

bool BlockSnapshotManager::unloadBlock(int block) {
    bool unloadSuccess;
    std::vector<int>::iterator i = findActiveBlock(block);
    
    if (i != activeBlocks_.end()){
        --activeRefCount_[i - activeBlocks_.begin()];
        if (activeRefCount_[i - activeBlocks_.begin()] < 0) {
            //in case, unloadBlock called multiple times
            activeRefCount_[i - activeBlocks_.begin()]  = 0;
        }
        
        unloadSuccess = true;
    } else {
        unloadSuccess = false;
    }

    return unloadSuccess;
}

void BlockSnapshotManager::internalLoad(int block) {
        
    for (int i = blocks_[block].first; i < blocks_[block].second; ++i) {
        snapshots_[i] = loadFrame(i);
    }
    
    std::vector<int>::iterator j;
    j = std::find(activeBlocks_.begin(), activeBlocks_.end(), -1);
    assert(j != activeBlocks_.end());
    *j = block;    
    ++activeRefCount_[j - activeBlocks_.begin()];
}

void BlockSnapshotManager::internalUnload(int block) {
    for (int i = blocks_[block].first; i < blocks_[block].second; ++i) {
        delete snapshots_[i];
        snapshots_[i] = NULL;
    }
    std::vector<int>::iterator j;
    j = std::find(activeBlocks_.begin(), activeBlocks_.end(), block);
    assert(j != activeBlocks_.end());
    *j = -1;
}

bool BlockSnapshotManager::hasZeroRefBlock(){
    return std::find(activeRefCount_.begin(), activeRefCount_.end(), 0) != activeRefCount_.end() ?  true : false;
}

int BlockSnapshotManager::getFirstZeroRefBlock(){
     std::vector<int>::iterator i = std::find(activeRefCount_.begin(), activeRefCount_.end(), 0);
     return i != activeRefCount_.end() ? activeBlocks_[i - activeRefCount_.begin()] : -1;
}

std::vector<int> BlockSnapshotManager::getActiveBlocks() {
    std::vector<int> result;
    oopse::copy_if(activeBlocks_.begin(), activeBlocks_.end(), std::back_inserter(result), 
        std::bind2nd(std::not_equal_to<int>(), -1));
    return result;    
}

Snapshot* BlockSnapshotManager::loadFrame(int frame){
    Snapshot* snapshot = new Snapshot(nAtoms_, nRigidBodies_, getStorageLayout());
    snapshot->setID(frame);
    
    /** @todo fixed me */
    Snapshot* oldSnapshot = currentSnapshot_;
    currentSnapshot_ = snapshot;   
    reader_->readFrame(frame);
    currentSnapshot_ = oldSnapshot;
    return snapshot;
}

int BlockSnapshotManager::getNFrames() {
    return reader_->getNFrames();
}

}
Revision:	354
Committed:	Wed Feb 16 20:30:50 2005 UTC (20 years, 2 months ago) by tim
File size:	7804 byte(s)
Log Message:	change the default bin number
#	User	Rev	Content
1	tim	318	/*
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	tim	354	#include "utils/residentMem.h"
44	tim	322	#include "utils/physmem.h"
45	tim	324	#include "utils/Algorithm.hpp"
46	tim	318	#include "brains/SimInfo.hpp"
47			#include "io/DumpReader.hpp"
48
49			namespace oopse {
50	tim	324	BlockSnapshotManager::BlockSnapshotManager(SimInfo* info, const std::string& filename,
51	tim	318	int storageLayout, int blockCapacity)
52	tim	351	: SnapshotManager(storageLayout), info_(info), blockCapacity_(blockCapacity),
53			activeBlocks_(blockCapacity_, -1), activeRefCount_(blockCapacity_, 0) {
54	tim	318
55			nAtoms_ = info->getNGlobalAtoms();
56			nRigidBodies_ = info->getNGlobalRigidBodies();
57
58	tim	354	double physMem = physmem_total();
59	tim	318	double avalPhysMem = physmem_available();
60	tim	354	double rssMem = residentMem();
61
62			std::cout << "physmem = " << physMem << "\t availablePhysMem = " << avalPhysMem << "\trssMem = "<< rssMem<<std::endl;
63	tim	318	int bytesPerStuntDouble = DataStorage::getBytesPerStuntDouble(storageLayout);
64
65	tim	323	int bytesPerFrame = (nRigidBodies_ + nAtoms_) * bytesPerStuntDouble;
66	tim	318
67	tim	354	int frameCapacity = int (rssMem / bytesPerFrame);
68	tim	318
69			nSnapshotPerBlock_ = frameCapacity /blockCapacity_ ;
70
71			reader_ = new DumpReader(info, filename);
72	tim	323	nframes_ = reader_->getNFrames();
73	tim	318
74	tim	323	int nblocks = nframes_ / nSnapshotPerBlock_;
75			if (nframes_ % nSnapshotPerBlock_ != 0) {
76	tim	318	++nblocks;
77			}
78
79			for (int i = 0; i < nblocks; ++i) {
80	tim	337	blocks_.push_back(SnapshotBlock(inSnapshotPerBlock_, (i+1)nSnapshotPerBlock_));
81	tim	318	}
82			//the last block may not have nSnapshotPerBlock frames, we need to consider this special situation
83	tim	324	blocks_.back().second = nframes_;
84	tim	318
85	tim	347	snapshots_.insert(snapshots_.begin(), nframes_, static_cast<Snapshot*>(NULL));
86	tim	318
87			}
88
89
90	tim	324	BlockSnapshotManager::~BlockSnapshotManager() {
91	tim	318	currentSnapshot_ = NULL;
92			previousSnapshot_ = NULL;
93
94			delete reader_;
95	tim	324
96			std::vector<int>::iterator i;
97			for (i = activeBlocks_.begin(); i != activeBlocks_.end(); ++i) {
98			if (*i != -1) {
99			unloadBlock(*i);
100			}
101			}
102	tim	318	}
103
104			int BlockSnapshotManager::getNActiveBlocks() {
105	tim	347	#ifdef __RWSTD
106			int count = 0;
107			std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1), count);
108			return count;
109			#else
110	tim	324	return std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1));
111	tim	347	#endif
112	tim	318	}
113
114
115	tim	351
116	tim	318	bool BlockSnapshotManager::loadBlock(int block) {
117	tim	351	std::vector<int>::iterator i = findActiveBlock(block);
118	tim	318	bool loadSuccess;
119	tim	351	if (i != activeBlocks_.end()) {
120			//if block is already in memory, just increast the reference count
121			++activeRefCount_[i - activeBlocks_.begin()];
122	tim	318	loadSuccess = true;
123			} else if (getNActiveBlocks() < blockCapacity_){
124	tim	351	//if number of active blocks is less than the block capacity, just load it
125			internalLoad(block);
126	tim	318	loadSuccess = true;
127	tim	351	} else if (hasZeroRefBlock() > 0) {
128			//if already reach the block capacity, need to unload a block with 0 reference
129			int zeroRefBlock = getFirstZeroRefBlock();
130			assert(zeroRefBlock != -1);
131			internalUnload(zeroRefBlock);
132			internalLoad(block);
133			} else {
134			//reach the capacity and all blocks in memory are not zero reference
135	tim	318	loadSuccess = false;
136			}
137	tim	351
138	tim	318	return loadSuccess;
139			}
140
141			bool BlockSnapshotManager::unloadBlock(int block) {
142			bool unloadSuccess;
143	tim	351	std::vector<int>::iterator i = findActiveBlock(block);
144
145			if (i != activeBlocks_.end()){
146			--activeRefCount_[i - activeBlocks_.begin()];
147			if (activeRefCount_[i - activeBlocks_.begin()] < 0) {
148			//in case, unloadBlock called multiple times
149			activeRefCount_[i - activeBlocks_.begin()] = 0;
150	tim	318	}
151	tim	351
152	tim	324	unloadSuccess = true;
153	tim	351	} else {
154			unloadSuccess = false;
155	tim	318	}
156	tim	324
157			return unloadSuccess;
158	tim	318	}
159
160	tim	351	void BlockSnapshotManager::internalLoad(int block) {
161
162			for (int i = blocks_[block].first; i < blocks_[block].second; ++i) {
163			snapshots_[i] = loadFrame(i);
164			}
165
166			std::vector<int>::iterator j;
167			j = std::find(activeBlocks_.begin(), activeBlocks_.end(), -1);
168			assert(j != activeBlocks_.end());
169			*j = block;
170			++activeRefCount_[j - activeBlocks_.begin()];
171			}
172
173			void BlockSnapshotManager::internalUnload(int block) {
174			for (int i = blocks_[block].first; i < blocks_[block].second; ++i) {
175			delete snapshots_[i];
176			snapshots_[i] = NULL;
177			}
178			std::vector<int>::iterator j;
179			j = std::find(activeBlocks_.begin(), activeBlocks_.end(), block);
180			assert(j != activeBlocks_.end());
181			*j = -1;
182			}
183
184			bool BlockSnapshotManager::hasZeroRefBlock(){
185	tim	352	return std::find(activeRefCount_.begin(), activeRefCount_.end(), 0) != activeRefCount_.end() ? true : false;
186	tim	351	}
187
188			int BlockSnapshotManager::getFirstZeroRefBlock(){
189			std::vector<int>::iterator i = std::find(activeRefCount_.begin(), activeRefCount_.end(), 0);
190			return i != activeRefCount_.end() ? activeBlocks_[i - activeRefCount_.begin()] : -1;
191			}
192
193	tim	318	std::vector<int> BlockSnapshotManager::getActiveBlocks() {
194			std::vector<int> result;
195	tim	324	oopse::copy_if(activeBlocks_.begin(), activeBlocks_.end(), std::back_inserter(result),
196			std::bind2nd(std::not_equal_to<int>(), -1));
197			return result;
198	tim	318	}
199
200			Snapshot* BlockSnapshotManager::loadFrame(int frame){
201			Snapshot* snapshot = new Snapshot(nAtoms_, nRigidBodies_, getStorageLayout());
202			snapshot->setID(frame);
203	tim	324
204			/** @todo fixed me */
205			Snapshot* oldSnapshot = currentSnapshot_;
206			currentSnapshot_ = snapshot;
207	tim	318	reader_->readFrame(frame);
208	tim	324	currentSnapshot_ = oldSnapshot;
209	tim	318	return snapshot;
210			}
211
212	tim	322	int BlockSnapshotManager::getNFrames() {
213			return reader_->getNFrames();
214	tim	318	}
215	tim	322
216			}