X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/57b69c40c630d8240cff989b5c35e449486aab8e..faf4f25d61d1bf77d5a2a4a21839a090612e46df:/process.h diff --git a/process.h b/process.h index b15f982..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,10 +13,13 @@ # 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: @@ -26,7 +30,8 @@ public: process(int argc, char* argv[]); virtual ~process(); - double get_load() const { return load; } + double get_comp() const { return comp; } + double get_real_load() const { return real_load; } int run(); @@ -37,8 +42,17 @@ protected: pneigh_type pneigh; // list of pointers to neighbors that // we are free to reorder - // Returns the sum of "to_send" for all neighbors. - double sum_of_to_send() const; + 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, @@ -52,7 +66,7 @@ protected: private: static double total_load_init; // sum of process loads at init - static double total_load_running; // summ of loads while running + 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; @@ -71,16 +85,15 @@ private: unsigned lb_iter; // counter of load-balancing iterations unsigned comp_iter; // counter of computation iterations + double comp; // total computing done so far (flops) + double prev_load_broadcast; // used to ensure that we do not send // a same information messages - double load; // current load + double real_load; // current load double expected_load; // expected load in bookkeeping mode // The load balancing algorithm comes here... - // Parameter "my_load" is the load to take into account for myself - // (may be load or expected load). - // Returns the total load sent to neighbors. - virtual double load_balance(double my_load); + virtual void load_balance(); // Virtually do some computation void compute(); @@ -88,13 +101,17 @@ private: // Send procedures, with helpers for bookkeeping mode or not void send1_no_bookkeeping(neighbor& nb); void send1_bookkeeping(neighbor& nb); - void send(); + void send_all(); // Returns true if there remains neighbors to listen for - bool may_receive() { return ctrl_close_pending || data_close_pending; } + bool may_receive() const { + return ctrl_close_pending || data_close_pending; + } - // Receive procedure: wait (or not) for a message to come - void receive(bool wait); + // 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. @@ -102,6 +119,36 @@ private: void finalize(); }; +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: