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