BIE Overview Quick Start Theoretical overview Available methods Parallel chains Computation engine Command Line Interface Graphical User Interface Assigning Output Visualization tool Data handling Software technology Parallel debugging Results to date Recent developments Links User guide Future features Project goals Project Team Copyright and license

/home/weinberg/src/BIE/include/LikelihoodComputationMPITP.h // This is really -*- C++ -*- #ifndef LikelihoodComputationMPITP_h #define LikelihoodComputationMPITP_h #include "Serializable.h" #include <BIEmpi.h> #include <TemperedSimulation.h> #include "EvaluationRequest.h" #include "TileRequestHandlerThread.h" #include "TileMPIThread.h" #include "TSLog.h" // for performance debugging #include <cc++/thread.h> using namespace ost; namespace BIE { class TileMasterWorkerThread; //+ CLICLASS LikelihoodComputationMPITP SUPER LikelihoodComputation class LikelihoodComputationMPITP : public LikelihoodComputation { friend class TileMasterWorkerThread; public: int getNumAndIdsOfTileMasters(int *num, int **idlist); private: int size; int M; int Ndim; vector<double> buff; State sb; double MPL_accum_time; double MPL_last_time; double acctime; int parallel_type; int nsub; TileRequestHandlerThread *tileRequestHandlerThread; TileMPIThread *tileMPIThread; TileMasterWorkerThread *tileMasterWorkerThread; void MPL_reset_timer(void); void MPL_start_timer(void); void MPL_stop_timer(void); double MPL_read_timer(int reset); void load_balance(void); vector<double> rate; int _workerReceiveFrom; void get_working(State& s, int indx, int pflag); void set_frontier(int pflag); void step_complete(); LikeState compute_likelihood_MPI(State& s, int indx); LikeState compute_likelihood_MPI_tile(State& s, int indx); LikeState compute_likelihood_MPI_intg(State& s, int indx); LikeState compute_likelihood_MPI_tile_and_point(State& sb, int indx); double modelEvaluateNormWorker(int tileId, double x, double y); vector<double> modelEvaluateWorker(int tileId, double x, double y, TSLog& logger); void RemoteEvaluation(EvaluationRequest& request); public: //+ CLICONSTR int int LikelihoodComputationMPITP(int M, int Ndim); ~LikelihoodComputationMPITP(void); double Likelihood(State&, int indx); double LikelihoodPrevious(State&, int indx); //+ CLIMETHOD void TileGranularity void TileGranularity(); //+ CLIMETHOD void IntegrationGranularity void IntegrationGranularity(); //+ CLIMETHOD void TilePointGranularity void TilePointGranularity(); void Granularity(int); // void SetSubdivisions(int); void enslave_worker(); void free_workers(void); double normEvaluate(Model* model, Tile* t, double x, double y, SampleDistribution* dist); vector<double> modelEvaluate(Model* model, Tile* t, double x, double y, SampleDistribution* dist); void modelEvaluateList(Model *model, Tile *t, const vector<double>& x, const vector<double>& y, SampleDistribution* sampleDistribution, vector< vector<double> >& evaluations); void normEvaluateList(Model *model, Tile *tile, const vector<double>& x, const vector<double>& y, SampleDistribution* sampleDistribution, vector<double>& evaluations); int numModelEvals; int counter; int slaveFreeCount; int slaveCreateCount; int _numTMs; vector<int> _tmList; static int NLOAD; static double beg; static double end; virtual bool Serial() { return false; } protected: virtual bool Slaves() { return true; } private: vector<double> beglist; vector<double> endlist; void pack_and_send() const; template<class Archive> void pre_save(Archive & ar, const unsigned int version) const { if (mpi_used) pack_and_send(); } template<class Archive> void post_load(Archive & ar, const unsigned int version) { if (mpi_used) { beg = beglist[myid]; end = endlist[myid]; } } // AUTO GENERATED BY ../persistence/autopersist.py protected: LikelihoodComputationMPITP() {} private: friend class boost::serialization::access; BOOST_SERIALIZATION_SPLIT_MEMBER(); template<class Archive> void save(Archive & ar, const unsigned int version) const { this->pre_save(ar, version); try { ar << BOOST_SERIALIZATION_BASE_OBJECT_NVP(LikelihoodComputation); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(size); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(M); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(Ndim); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(buff); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(sb); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(MPL_accum_time); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(MPL_last_time); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(acctime); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(parallel_type); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(nsub); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(rate); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(_workerReceiveFrom); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(numModelEvals); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(counter); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(slaveFreeCount); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(slaveCreateCount); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(_numTMs); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(_tmList); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(NLOAD); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(beg); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(end); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(beglist); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(endlist); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_save(ar, version); } template<class Archive> void load(Archive & ar, const unsigned int version) { this->pre_load(ar, version); try { ar >> BOOST_SERIALIZATION_BASE_OBJECT_NVP(LikelihoodComputation); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(size); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(M); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(Ndim); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(buff); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(sb); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(MPL_accum_time); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(MPL_last_time); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(acctime); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(parallel_type); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(nsub); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(rate); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(_workerReceiveFrom); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(numModelEvals); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(counter); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(slaveFreeCount); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(slaveCreateCount); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(_numTMs); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(_tmList); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(NLOAD); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(beg); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(end); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(beglist); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(endlist); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_load(ar, version); } }; } BIE_CLASS_TYPE_INFO(BIE::LikelihoodComputationMPITP) BIE_CLASS_EXPORT_KEY(BIE::LikelihoodComputationMPITP) #endif