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/LikelihoodComputationMPI.h // This is really -*- C++ -*- #ifndef LikelihoodComputationMPI_h #define LikelihoodComputationMPI_h #include "Serializable.h" #include "BIEmpi.h" #include "LikelihoodComputation.h" namespace BIE { //+ CLICLASS LikelihoodComputationMPI SUPER LikelihoodComputation class LikelihoodComputationMPI : public LikelihoodComputation { private: unsigned int size; double *buff; ; State sb; int Ndim; // needed to compute size of buffer for MPI int M; double MPL_accum_time, MPL_last_time, acctime; int parallel_type, nsub; unsigned long parallel_count; int counter; 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; 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); protected: virtual bool Slaves() { return true; } public: //+ CLICONSTR int int LikelihoodComputationMPI(int M, int Ndim); ~LikelihoodComputationMPI(void); double Likelihood(State&, int indx); double LikelihoodPrevious(State&, int indx); //+ CLIMETHOD void TileGranularity void TileGranularity(); //+ CLIMETHOD void IntegrationGranularity void IntegrationGranularity(); void Granularity(int); void SetSubdivisions(int); void enslave_worker(void*); void free_workers(void); static int NLOAD; static double beg; static double end; public: virtual void normEvaluateList(Model *model, Tile *tile, const vector<double>& x, const vector<double>& y, SampleDistribution* sampleDistribution, vector<double>& evaluations); virtual void modelEvaluateList(Model *model, Tile *tile, const vector<double>& x, const vector<double>& y, SampleDistribution* sampleDistribution, vector< vector<double> >& evaluations); virtual bool Serial() { return false; } 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: LikelihoodComputationMPI() {} 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(sb); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(Ndim); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(M); 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(parallel_count); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(counter); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(rate); 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; } char __buf[128]; for(uint32 __i=0; __i<size; __i++) { sprintf(__buf, "buff_%d", __i); try { ar << boost::serialization::make_nvp(__buf, buff[__i]); } catch (::boost::archive::archive_exception & e) { throw new BoostSerializationException(string(e.what()),__buf, __FILE__,__LINE__); } catch (BoostSerializationException * e) { throw new BoostSerializationException(e, __buf,__FILE__,__LINE__); } } 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(sb); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(Ndim); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(M); 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(parallel_count); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(counter); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(rate); 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; } char __buf[128]; buff = new double[size]; for(uint32 __i=0; __i<size; __i++) { sprintf(__buf, "buff_%d", __i); try { ar >> boost::serialization::make_nvp(__buf, buff[__i]); } catch (::boost::archive::archive_exception & e) { throw new BoostSerializationException(string(e.what()),__buf, __FILE__,__LINE__); } catch (BoostSerializationException * e) { throw new BoostSerializationException(e, __buf,__FILE__,__LINE__); } } this->post_load(ar, version); } }; } BIE_CLASS_TYPE_INFO(BIE::LikelihoodComputationMPI) BIE_CLASS_EXPORT_KEY(BIE::LikelihoodComputationMPI) #endif