//#undef USE_UNORDERED_MAP
#include <algorithm>
-#include <tr1/functional>
+#include <functional>
#ifdef USE_UNORDERED_MAP
-# include <tr1/unordered_map>
-# define MAP_TEMPLATE std::tr1::unordered_map
+# include <unordered_map>
+# define MAP_TEMPLATE std::unordered_map
#else
# include <map>
# define MAP_TEMPLATE std::map
// a same information messages
double real_load; // current load
double expected_load; // expected load in bookkeeping mode
+ double received_load; // load received from neighbors
mutex_t mutex; // synchronization between threads
condition_t cond;
mesg_accounting ctrl_recv; // ctrl message received
accounting(): comp_amount(0.0) { }
};
- accounting acc;
+ accounting acc; // use a structure so that it is
+ // automatically initialized a
+ // construction
void add_comp_amount(double amount) { acc.comp_amount += amount; }
void add_data_send_mesg(double amount) {
// Returns the sum of "to_send" for all neighbors.
double get_sum_of_to_send() const;
+ // Compute load_to_send (for data_send), subject to the execution parameters
+ static double compute_load_to_send(double desired);
+
// Send procedures
void ctrl_send(neighbor& nb);
void data_send(neighbor& nb);
template <typename Compare>
void process::pneigh_sort_by_load(const Compare& comp)
{
- using std::tr1::bind;
- using std::tr1::placeholders::_1;
- using std::tr1::placeholders::_2;
+ using std::placeholders::_1;
+ using std::placeholders::_2;
std::sort(pneigh.begin(), pneigh.end(),
- bind(comp,
- bind(&neighbor::get_load, _1),
- bind(&neighbor::get_load, _2)));
+ std::bind(comp,
+ std::bind(&neighbor::get_load, _1),
+ std::bind(&neighbor::get_load, _2)));
}
#endif // !PROCESS_H