process.h

   1 #ifndef PROCESS_H
   2 #define PROCESS_H
   3
   4 #define USE_UNORDERED_MAP 1
   5 //#undef USE_UNORDERED_MAP
   6
   7 #include <vector>
   8 #ifdef USE_UNORDERED_MAP
   9 #  include <tr1/unordered_map>
  10 #  define MAP_TEMPLATE std::tr1::unordered_map
  11 #else
  12 #  include <map>
  13 #  define MAP_TEMPLATE std::map
  14 #endif
  15 #include <msg/msg.h>
  16 #include <xbt/log.h>
  17 #include "communicator.h"
  18 #include "neighbor.h"
  19
  20 class process {
  21 public:
  22     static double get_total_load_init() { return total_load_init; }
  23     static double get_total_load_exit() { return total_load_exit; }
  24
  25     process(int argc, char* argv[]);
  26     virtual ~process();
  27
  28     int run();
  29
  30 protected:
  31     typedef std::vector<neighbor> neigh_type;
  32     typedef std::vector<neighbor*> pneigh_type;
  33
  34     pneigh_type pneigh;         // list of pointers to neighbors that
  35                                 // we are free to reorder
  36
  37     // Returns the sum of "to_send" for all neighbors.
  38     double sum_of_to_send() const;
  39
  40     // Calls neighbor::print(verbose, logp, cat) for each member of neigh.
  41     void print_loads(bool verbose = false,
  42                      e_xbt_log_priority_t logp = xbt_log_priority_info,
  43                      xbt_log_category_t cat = _XBT_LOGV(default)) const;
  44
  45     // Calls neighbor::print(verbose, logp, cat) for each member of pneigh.
  46     void print_loads_p(bool verbose = false,
  47                        e_xbt_log_priority_t logp = xbt_log_priority_info,
  48                        xbt_log_category_t cat = _XBT_LOGV(default)) const;
  49
  50 private:
  51     static double total_load_init; // sum of neighbor loads at init
  52     static double total_load_exit; // sum of neighbor loads at exit
  53
  54     typedef MAP_TEMPLATE<m_host_t, neighbor*> rev_neigh_type;
  55     neigh_type neigh;           // list of neighbors (do not alter
  56                                 // after construction!)
  57     rev_neigh_type rev_neigh;   // map m_host_t -> neighbor
  58
  59     communicator comm;          // communicator for this process
  60     int ctrl_close_pending;     // number of "close" messages to wait
  61                                 // on ctrl channel
  62     int data_close_pending;     // number of "close" messages to wait
  63                                 // on data channel
  64     bool close_received;        // true if we received a "close" message
  65     bool may_receive;           // true if there remains neighbors to listen for
  66
  67     unsigned iter;              // counter of iterations
  68
  69     double prev_load_broadcast; // used to ensure that we do not send
  70                                 // a same information messages
  71     double load;                // current load
  72     double expected_load;       // expected load in bookkeeping mode
  73
  74     // The load balancing algorithm comes here...
  75     // Parameter "my_load" is the load to take into account for myself
  76     // (may be load or expected load).
  77     // Returns the total load sent to neighbors.
  78     virtual double load_balance(double my_load);
  79
  80     // Virtually do some computation
  81     void compute();
  82
  83     // Send procedures, with helpers for bookkeeping mode or not
  84     void send1_no_bookkeeping(neighbor& nb);
  85     void send1_bookkeeping(neighbor& nb);
  86     void send();
  87
  88     // Receive procedure: wait (or not) for a message to come.
  89     enum recv_wait_mode { NO_WAIT = 0, WAIT, WAIT_FOR_CLOSE };
  90     void receive(recv_wait_mode wait);
  91
  92     // Finalize sends a "close" message to each neighbor and wait for
  93     // all of them to answer.
  94     void finalize1(neighbor& nb);
  95     void finalize();
  96 };
  97
  98 #endif // !PROCESS_H
  99
 100 // Local variables:
 101 // mode: c++
 102 // End: