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 <algorithm>
   8 #include <functional>
   9 #ifdef USE_UNORDERED_MAP
  10 #  include <unordered_map>
  11 #  define MAP_TEMPLATE std::unordered_map
  12 #else
  13 #  include <map>
  14 #  define MAP_TEMPLATE std::map
  15 #endif
  16 #include <vector>
  17 #include <msg/msg.h>
  18 #include <xbt/log.h>
  19 #include "communicator.h"
  20 #include "misc.h"
  21 #include "msg_thread.h"
  22 #include "neighbor.h"
  23 #include "options.h"
  24 #include "synchro.h"
  25
  26 class process {
  27 public:
  28     static double get_total_load_init()    { return total_load_init;    }
  29     static double get_total_load_running() { return total_load_running; }
  30     static double get_total_load_exit()    { return total_load_exit;    }
  31
  32     process(int argc, char* argv[]);
  33     virtual ~process();
  34
  35     double get_real_load() const           { return real_load;            }
  36     double get_comp_amount() const         { return acc.comp_amount;      }
  37     unsigned get_comp_iter() const         { return comp_iter;            }
  38     unsigned get_all_comp_iter() const     { return all_comp_iter;        }
  39     double get_data_send_amount() const    { return acc.data_send.amount; }
  40     double get_data_recv_amount() const    { return acc.data_recv.amount; }
  41     unsigned get_data_send_count() const   { return acc.data_send.count;  }
  42     unsigned get_data_recv_count() const   { return acc.data_recv.count;  }
  43     double get_ctrl_send_amount() const    { return acc.ctrl_send.amount; }
  44     double get_ctrl_recv_amount() const    { return acc.ctrl_recv.amount; }
  45     unsigned get_ctrl_send_count() const   { return acc.ctrl_send.count;  }
  46     unsigned get_ctrl_recv_count() const   { return acc.ctrl_recv.count;  }
  47     double get_convergence() const         { return convergence;          }
  48
  49     int run();
  50
  51 protected:
  52     typedef std::vector<neighbor> neigh_type;
  53     typedef std::vector<neighbor*> pneigh_type;
  54
  55     pneigh_type pneigh;         // list of pointers to neighbors that
  56                                 // we are free to reorder
  57
  58     // Get and set current load, which may be real load, or expected
  59     // load if opt::bookkeeping is true.
  60     double get_load() const                { return expected_load; }
  61
  62     // The load balancing algorithm comes here...
  63     virtual void load_balance();
  64
  65     // Register some amount of load to send to given neighbor.
  66     void send(neighbor& nb, double amount);
  67     void send(neighbor* nb, double amount) { send(*nb, amount); }
  68
  69     // Sort pneigh by applying comp to their loads
  70     template <typename Compare>
  71     void pneigh_sort_by_load(const Compare& comp);
  72
  73     // Calls neighbor::print(verbose, logp, cat) for each member of neigh.
  74     void print_loads(bool verbose = false,
  75                      e_xbt_log_priority_t logp = xbt_log_priority_info,
  76                      xbt_log_category_t cat = _XBT_LOGV(default)) const;
  77
  78     // Calls neighbor::print(verbose, logp, cat) for each member of pneigh.
  79     void print_loads_p(bool verbose = false,
  80                        e_xbt_log_priority_t logp = xbt_log_priority_info,
  81                        xbt_log_category_t cat = _XBT_LOGV(default)) const;
  82
  83 private:
  84     static double total_load_init; // sum of process loads at init
  85     static double total_load_running; // sum of loads while running
  86     static double total_load_exit; // sum of process loads at exit
  87
  88     static int process_counter;
  89     static double total_load_average;
  90     static double load_diff_threshold;
  91
  92     typedef MAP_TEMPLATE<m_host_t, neighbor*> rev_neigh_type;
  93     neigh_type neigh;           // list of neighbors (do not alter
  94                                 // after construction!)
  95     rev_neigh_type rev_neigh;   // map m_host_t -> neighbor
  96
  97     communicator comm;          // communicator for this process
  98     int ctrl_close_pending;     // number of "close" messages to wait
  99                                 // on ctrl channel
 100     int data_close_pending;     // number of "close" messages to wait
 101                                 // on data channel
 102     bool close_received;        // true if we received a "close" message
 103     bool finalizing;            // true when finalize() is running
 104
 105     unsigned lb_iter;           // counter of load-balancing iterations
 106     unsigned comp_iter;         // counter of computation iterations
 107     unsigned all_comp_iter;     // counter of computation iterations
 108                                 // (counting empty iterations too)
 109
 110     double prev_load_broadcast; // used to ensure that we do not send
 111                                 // a same information messages
 112     double real_load;           // current load
 113     double expected_load;       // expected load in bookkeeping mode
 114     double received_load;       // load received from neighbors
 115
 116     double convergence;         // date when convergence was achieved, or -1.0
 117
 118     mutex_t mutex;              // synchronization between threads
 119     condition_t cond;
 120
 121     struct mesg_accounting {
 122         double amount;          // sum of message size
 123         unsigned count;         // number of messages
 124         mesg_accounting(): amount(0.0), count(0) { }
 125     };
 126     struct accounting {
 127         double comp_amount;        // total computing done so far (flops)
 128         mesg_accounting data_send; // data messages sent
 129         mesg_accounting data_recv; // data messages received
 130         mesg_accounting ctrl_send; // ctrl message sent
 131         mesg_accounting ctrl_recv; // ctrl message received
 132         accounting(): comp_amount(0.0) { }
 133     };
 134     accounting acc;             // use a structure so that it is
 135                                 // automatically initialized a
 136                                 // construction
 137
 138     void add_comp_amount(double amount) { acc.comp_amount += amount; }
 139     void add_data_send_mesg(double amount) {
 140         ++acc.data_send.count;
 141         acc.data_send.amount += amount;
 142     }
 143     void add_data_recv_mesg(double amount) {
 144         ++acc.data_recv.count;
 145         acc.data_recv.amount += amount;
 146     }
 147     void add_ctrl_send_mesg(double amount) {
 148         ++acc.ctrl_send.count;
 149         acc.ctrl_send.amount += amount;
 150     }
 151     void add_ctrl_recv_mesg(double amount) {
 152         ++acc.ctrl_recv.count;
 153         acc.ctrl_recv.amount += amount;
 154     }
 155
 156     // Load-balancing loop
 157     msg_thread* lb_thread;
 158     void load_balance_loop();
 159
 160     // Simulate computation loop
 161     void compute_loop();
 162
 163     // Check for convergence
 164     void convergence_check();
 165
 166     // Check if we need to stop
 167     bool still_running();
 168
 169     // Returns the sum of "to_send" for all neighbors.
 170     double get_sum_of_to_send() const;
 171
 172     // Compute load_to_send (for data_send), subject to the execution parameters
 173     static double compute_load_to_send(double desired);
 174
 175     // Send procedures
 176     void ctrl_send(neighbor& nb);
 177     void data_send(neighbor& nb);
 178     void ctrl_close(neighbor& nb);
 179     void data_close(neighbor& nb);
 180
 181     // Receive procedure
 182     // Parameter "timeout" may be 0 for non-blocking operation, -1 for
 183     // infinite waiting, or any positive timeout.
 184     void ctrl_receive(double timeout);
 185     void data_receive(double timeout);
 186     void handle_message(message* msg, m_host_t from);
 187 };
 188
 189 template <typename Compare>
 190 void process::pneigh_sort_by_load(const Compare& comp)
 191 {
 192     using std::placeholders::_1;
 193     using std::placeholders::_2;
 194     std::sort(pneigh.begin(), pneigh.end(),
 195               std::bind(comp,
 196                         std::bind(&neighbor::get_load, _1),
 197                         std::bind(&neighbor::get_load, _2)));
 198 }
 199
 200 #endif // !PROCESS_H
 201
 202 // Local variables:
 203 // mode: c++
 204 // End: