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