4 #define USE_UNORDERED_MAP 1
5 //#undef USE_UNORDERED_MAP
9 #ifdef USE_UNORDERED_MAP
10 # include <unordered_map>
11 # define MAP_TEMPLATE std::unordered_map
14 # define MAP_TEMPLATE std::map
17 #include <simgrid/msg.h>
19 #include "communicator.h"
21 #include "msg_thread.h"
24 #include "simgrid_features.h"
29 static void set_proc_mutex(mutex_t* m) { proc_mutex = m; }
31 // Note: normally used with proc_mutex locked.
32 static double get_total_load_init() { return total_load_init; }
33 static double get_total_load_running() { return total_load_running; }
34 static double get_total_load_exit() { return total_load_exit; }
36 process(int argc, char* argv[]);
39 double get_real_load() const { return real_load; }
40 double get_comp_amount() const { return acc.comp_amount; }
41 unsigned get_comp_iter() const { return comp_iter; }
42 unsigned get_all_comp_iter() const { return all_comp_iter; }
43 double get_iter_deviation() const;
44 double get_data_send_amount() const { return acc.data_send.amount; }
45 double get_data_recv_amount() const { return acc.data_recv.amount; }
46 unsigned get_data_send_count() const { return acc.data_send.count; }
47 unsigned get_data_recv_count() const { return acc.data_recv.count; }
48 double get_ctrl_send_amount() const { return acc.ctrl_send.amount; }
49 double get_ctrl_recv_amount() const { return acc.ctrl_recv.amount; }
50 unsigned get_ctrl_send_count() const { return acc.ctrl_send.count; }
51 unsigned get_ctrl_recv_count() const { return acc.ctrl_recv.count; }
52 double get_idle_duration() const { return idle_duration; }
53 double get_convergence() const { return convergence; }
58 typedef std::vector<neighbor> neigh_type;
59 typedef std::vector<neighbor*> pneigh_type;
61 pneigh_type pneigh; // list of pointers to neighbors that
62 // we are free to reorder
64 // Get and set current load, which may be real load, or expected
65 // load if opt::bookkeeping is true.
66 double get_load() const { return expected_load; }
68 // The load balancing algorithm comes here...
69 virtual void load_balance();
71 // Register some amount of load to send to given neighbor.
72 void send(neighbor& nb, double amount);
73 void send(neighbor* nb, double amount) { send(*nb, amount); }
75 // Sort pneigh by applying comp to their loads
76 template <typename Compare>
77 void pneigh_sort_by_load(const Compare& comp);
79 // Calls neighbor::print(verbose, logp, cat) for each member of neigh.
80 void print_loads(bool verbose = false,
81 e_xbt_log_priority_t logp = xbt_log_priority_info,
82 xbt_log_category_t cat = _XBT_LOGV(default)) const;
84 // Calls neighbor::print(verbose, logp, cat) for each member of pneigh.
85 void print_loads_p(bool verbose = false,
86 e_xbt_log_priority_t logp = xbt_log_priority_info,
87 xbt_log_category_t cat = _XBT_LOGV(default)) const;
90 static mutex_t *proc_mutex; // protect access to global variables
91 // (must be set before constructing
94 static double total_load_init; // sum of process loads at init
95 static double total_load_running; // sum of loads while running
96 static double total_load_exit; // sum of process loads at exit
98 static int process_counter;
99 static double total_load_average;
100 static double average_load_ratio;
101 static double load_diff_threshold;
103 static std::atomic<int> convergence_counter;
105 typedef MAP_TEMPLATE<msg_host_t, neighbor*> rev_neigh_type;
106 neigh_type neigh; // list of neighbors (do not alter
107 // after construction!)
108 rev_neigh_type rev_neigh; // map msg_host_t -> neighbor
110 communicator comm; // communicator for this process
111 int ctrl_close_pending; // number of "close" messages to wait
113 int data_close_pending; // number of "close" messages to wait
115 bool close_received; // true if we received a "close" message
116 bool finalizing; // true when finalize() is running
118 unsigned lb_iter; // counter of load-balancing iterations
119 unsigned comp_iter; // counter of computation iterations
120 unsigned all_comp_iter; // counter of computation iterations
121 // (counting empty iterations too)
123 double prev_load_broadcast; // used to ensure that we do not send
124 // a same information messages
125 double real_load; // current load
126 double expected_load; // expected load in bookkeeping mode
127 double received_load; // load received from neighbors
129 double idle_duration; // how long we had nothing to compute
130 double convergence; // date when convergence was achieved, or -1.0
131 int local_convergence_counter; // number of iterations since convergence
133 mutex_t mutex; // synchronization between threads
136 struct mesg_accounting {
137 double amount; // sum of message size
138 unsigned count; // number of messages
139 mesg_accounting(): amount(0.0), count(0) { }
142 double comp_amount; // total computing done so far (flops)
143 mesg_accounting data_send; // data messages sent
144 mesg_accounting data_recv; // data messages received
145 mesg_accounting ctrl_send; // ctrl message sent
146 mesg_accounting ctrl_recv; // ctrl message received
147 accounting(): comp_amount(0.0) { }
149 accounting acc; // use a structure so that it is
150 // automatically initialized a
153 void add_comp_amount(double amount) { acc.comp_amount += amount; }
154 void add_data_send_mesg(double amount) {
155 ++acc.data_send.count;
156 acc.data_send.amount += amount;
158 void add_data_recv_mesg(double amount) {
159 ++acc.data_recv.count;
160 acc.data_recv.amount += amount;
162 void add_ctrl_send_mesg(double amount) {
163 ++acc.ctrl_send.count;
164 acc.ctrl_send.amount += amount;
166 void add_ctrl_recv_mesg(double amount) {
167 ++acc.ctrl_recv.count;
168 acc.ctrl_recv.amount += amount;
171 // Load-balancing loop
172 msg_thread* lb_thread;
173 void load_balance_loop();
175 // Simulate computation loop
178 // Check for convergence
179 void convergence_check();
181 // Check if we need to stop
182 bool still_running();
184 // Returns the sum of "to_send" for all neighbors.
185 double get_sum_of_to_send() const;
187 // Compute load_to_send (for data_send), subject to the execution parameters
188 static double compute_load_to_send(double desired);
191 void ctrl_send(neighbor& nb);
192 void data_send(neighbor& nb);
193 void ctrl_close(neighbor& nb);
194 void data_close(neighbor& nb);
197 // Parameter "timeout" may be 0 for non-blocking operation, -1 for
198 // infinite waiting, or any positive timeout.
199 void ctrl_receive(double timeout);
200 void data_receive(double timeout);
201 void handle_message(message* msg, msg_host_t from);
204 template <typename Compare>
205 void process::pneigh_sort_by_load(const Compare& comp)
207 std::sort(pneigh.begin(), pneigh.end(),
208 [&comp](const neighbor* a, const neighbor* b) {
209 return comp(a->get_load(), b->get_load());