X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/325b135f0ee33c6c0242a14e2f58a54fb571b032..4ed2ded99f037e413c9008a324c85f8f95611bb5:/process.h diff --git a/process.h b/process.h index c148683..38a6c42 100644 --- a/process.h +++ b/process.h @@ -4,7 +4,8 @@ #define USE_UNORDERED_MAP 1 //#undef USE_UNORDERED_MAP -#include +#include +#include #ifdef USE_UNORDERED_MAP # include # define MAP_TEMPLATE std::tr1::unordered_map @@ -12,52 +13,142 @@ # include # define MAP_TEMPLATE std::map #endif +#include #include +#include #include "communicator.h" +#include "misc.h" #include "neighbor.h" +#include "options.h" class process { public: + static double get_total_load_init() { return total_load_init; } + static double get_total_load_running() { return total_load_running; } + static double get_total_load_exit() { return total_load_exit; } + process(int argc, char* argv[]); - ~process(); + virtual ~process(); + + double get_comp() const { return comp; } + double get_real_load() const { return real_load; } + int run(); protected: typedef std::vector neigh_type; typedef std::vector pneigh_type; - neigh_type neigh; - pneigh_type pneigh; + pneigh_type pneigh; // list of pointers to neighbors that + // we are free to reorder + + template + void pneigh_sort_by_load(const Compare& comp); + + // Get and set current load, which may be real load, or expected + // load if opt::bookkeeping is true. + double get_load() const; + void set_load(double load); + + // Register some amount of load to send to given neighbor. + void send(neighbor& nb, double amount); + void send(neighbor* nb, double amount) { send(*nb, amount); } + + // Calls neighbor::print(verbose, logp, cat) for each member of neigh. + void print_loads(bool verbose = false, + e_xbt_log_priority_t logp = xbt_log_priority_info, + xbt_log_category_t cat = _XBT_LOGV(default)) const; + + // Calls neighbor::print(verbose, logp, cat) for each member of pneigh. + void print_loads_p(bool verbose = false, + e_xbt_log_priority_t logp = xbt_log_priority_info, + xbt_log_category_t cat = _XBT_LOGV(default)) const; private: + static double total_load_init; // sum of process loads at init + static double total_load_running; // sum of loads while running + static double total_load_exit; // sum of process loads at exit + typedef MAP_TEMPLATE 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; + communicator comm; // communicator for this process + int ctrl_close_pending; // number of "close" messages to wait + // on ctrl channel + int data_close_pending; // number of "close" messages to wait + // on data channel + bool close_received; // true if we received a "close" message + bool finalizing; // true when finalize() is running - communicator comm; - int ctrl_close_pending; - int data_close_pending; + unsigned lb_iter; // counter of load-balancing iterations + unsigned comp_iter; // counter of computation iterations - unsigned iter; + double comp; // total computing done so far (flops) - double load; - double expected_load; + double prev_load_broadcast; // used to ensure that we do not send + // a same information messages + double real_load; // current load + double expected_load; // expected load in bookkeeping mode - double sum_of_to_send() const; - virtual double load_balance(double my_load); + // The load balancing algorithm comes here... + virtual void load_balance(); + // Virtually do some computation void compute(); + + // Send procedures, with helpers for bookkeeping mode or not void send1_no_bookkeeping(neighbor& nb); void send1_bookkeeping(neighbor& nb); - void send(); - bool receive(bool wait_for_close); + void send_all(); + + // Returns true if there remains neighbors to listen for + bool may_receive() const { + return ctrl_close_pending || data_close_pending; + } + + // Receive procedure + // Parameter "timeout" may be 0 for non-blocking operation, -1 for + // infinite waiting, or any positive timeout. + void receive(double timeout); + + // Finalize sends a "close" message to each neighbor and wait for + // all of them to answer. void finalize1(neighbor& nb); void finalize(); - void print_loads(e_xbt_log_priority_t logp = xbt_log_priority_info); - - void insert_neighbor_in_map(neighbor& nb); }; +inline +double process::get_load() const +{ + if (opt::bookkeeping) + return expected_load; + else + return real_load; +} + +inline +void process::set_load(double load) +{ + if (opt::bookkeeping) + expected_load = load; + else + real_load = load; +} + +template +void process::pneigh_sort_by_load(const Compare& comp) +{ + using std::tr1::bind; + using std::tr1::placeholders::_1; + using std::tr1::placeholders::_2; + std::sort(pneigh.begin(), pneigh.end(), + bind(comp, + bind(&neighbor::get_load, _1), + bind(&neighbor::get_load, _2))); +} + #endif // !PROCESS_H // Local variables: