X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/245565c060611ddfed5067ab4000e91e440c402c..20ee10ed13aee7d9fb9c844648d5159ed4a054d2:/process.h?ds=sidebyside diff --git a/process.h b/process.h index 5e1faa6..f01c3c6 100644 --- a/process.h +++ b/process.h @@ -1,27 +1,18 @@ #ifndef PROCESS_H #define PROCESS_H -#define USE_UNORDERED_MAP 1 -//#undef USE_UNORDERED_MAP - #include -#include -#ifdef USE_UNORDERED_MAP -# include -# define MAP_TEMPLATE std::unordered_map -#else -# include -# define MAP_TEMPLATE std::map -#endif +#include +#include #include -#include +#include #include -#include "atomic_compat.h" #include "communicator.h" #include "misc.h" #include "msg_thread.h" #include "neighbor.h" #include "options.h" +#include "simgrid_features.h" #include "synchro.h" class process { @@ -97,14 +88,15 @@ private: static int process_counter; static double total_load_average; + static double average_load_ratio; static double load_diff_threshold; static std::atomic convergence_counter; - typedef MAP_TEMPLATE rev_neigh_type; + typedef std::unordered_map rev_neigh_type; neigh_type neigh; // list of neighbors (do not alter // after construction!) - rev_neigh_type rev_neigh; // map m_host_t -> neighbor + rev_neigh_type rev_neigh; // map msg_host_t -> neighbor communicator comm; // communicator for this process int ctrl_close_pending; // number of "close" messages to wait @@ -127,6 +119,7 @@ private: double idle_duration; // how long we had nothing to compute double convergence; // date when convergence was achieved, or -1.0 + int local_convergence_counter; // number of iterations since convergence mutex_t mutex; // synchronization between threads condition_t cond; @@ -196,18 +189,16 @@ private: // infinite waiting, or any positive timeout. void ctrl_receive(double timeout); void data_receive(double timeout); - void handle_message(message* msg, m_host_t from); + void handle_message(message* msg, msg_host_t from); }; template void process::pneigh_sort_by_load(const Compare& comp) { - using std::placeholders::_1; - using std::placeholders::_2; std::sort(pneigh.begin(), pneigh.end(), - std::bind(comp, - std::bind(&neighbor::get_load, _1), - std::bind(&neighbor::get_load, _2))); + [&comp](const neighbor* a, const neighbor* b) { + return comp(a->get_load(), b->get_load()); + }); } #endif // !PROCESS_H