#ifndef PROCESS_H
#define PROCESS_H
+#define USE_UNORDERED_MAP 1
+//#undef USE_UNORDERED_MAP
+
+#include <algorithm>
+#include <tr1/functional>
+#ifdef USE_UNORDERED_MAP
+# include <tr1/unordered_map>
+# define MAP_TEMPLATE std::tr1::unordered_map
+#else
+# include <map>
+# define MAP_TEMPLATE std::map
+#endif
#include <vector>
+#include <msg/msg.h>
#include <xbt/log.h>
#include "communicator.h"
+#include "misc.h"
+#include "msg_thread.h"
#include "neighbor.h"
+#include "options.h"
class process {
public:
- process(int argc, char *argv[]);
- ~process() { };
- void print_loads(e_xbt_log_priority_t logp = xbt_log_priority_info);
+ static double get_total_load_init() { return total_load_init; }
+ static double get_total_load_running() { return total_load_running; }
+ static double get_total_load_exit() { return total_load_exit; }
+
+ process(int argc, char* argv[]);
+ virtual ~process();
+
+ double get_comp() const { return comp; }
+ double get_real_load() const { return real_load; }
+
int run();
+protected:
+ typedef std::vector<neighbor> neigh_type;
+ typedef std::vector<neighbor*> pneigh_type;
+
+ pneigh_type pneigh; // list of pointers to neighbors that
+ // we are free to reorder
+
+ // Get and set current load, which may be real load, or expected
+ // load if opt::bookkeeping is true.
+ double get_load() const;
+ void set_load(double load);
+
+ // The load balancing algorithm comes here...
+ virtual void load_balance();
+
+ // Register some amount of load to send to given neighbor.
+ void send(neighbor& nb, double amount);
+ void send(neighbor* nb, double amount) { send(*nb, amount); }
+
+ // Sort pneigh by applying comp to their loads
+ template <typename Compare>
+ void pneigh_sort_by_load(const Compare& comp);
+
+ // Calls neighbor::print(verbose, logp, cat) for each member of neigh.
+ void print_loads(bool verbose = false,
+ e_xbt_log_priority_t logp = xbt_log_priority_info,
+ xbt_log_category_t cat = _XBT_LOGV(default)) const;
+
+ // Calls neighbor::print(verbose, logp, cat) for each member of pneigh.
+ void print_loads_p(bool verbose = false,
+ e_xbt_log_priority_t logp = xbt_log_priority_info,
+ xbt_log_category_t cat = _XBT_LOGV(default)) const;
+
private:
- communicator comm;
- std::vector<neighbor> neigh;
- double load;
+ static double total_load_init; // sum of process loads at init
+ static double total_load_running; // sum of loads while running
+ static double total_load_exit; // sum of process loads at exit
+
+ typedef MAP_TEMPLATE<m_host_t, neighbor*> rev_neigh_type;
+ neigh_type neigh; // list of neighbors (do not alter
+ // after construction!)
+ rev_neigh_type rev_neigh; // map m_host_t -> neighbor
+
+ communicator comm; // communicator for this process
+ int ctrl_close_pending; // number of "close" messages to wait
+ // on ctrl channel
+ int data_close_pending; // number of "close" messages to wait
+ // on data channel
+ bool close_received; // true if we received a "close" message
+ bool finalizing; // true when finalize() is running
+
+ unsigned lb_iter; // counter of load-balancing iterations
+ unsigned comp_iter; // counter of computation iterations
+
+ double comp; // total computing done so far (flops)
+
+ double prev_load_broadcast; // used to ensure that we do not send
+ // a same information messages
+ double real_load; // current load
+ double expected_load; // expected load in bookkeeping mode
+
+ // Load-balancing loop
+ void load_balance_loop();
+
+ // Simulate computation loop
+ msg_thread* compute_thread;
+ void compute_loop();
+
+ bool still_running();
+
+ // Send procedures
+ void ctrl_send(neighbor& nb);
+ void data_send(neighbor& nb);
+ void ctrl_close(neighbor& nb);
+ void data_close(neighbor& nb);
+
+ // Receive procedure
+ // Parameter "timeout" may be 0 for non-blocking operation, -1 for
+ // infinite waiting, or any positive timeout.
+ void ctrl_receive(double timeout);
+ void data_receive(double timeout);
+ void handle_message(message* msg, m_host_t from);
};
+inline
+double process::get_load() const
+{
+ if (opt::bookkeeping)
+ return expected_load;
+ else
+ return real_load;
+}
+
+inline
+void process::set_load(double load)
+{
+ if (opt::bookkeeping)
+ expected_load = load;
+ else
+ real_load = load;
+}
+
+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;
+ std::sort(pneigh.begin(), pneigh.end(),
+ bind(comp,
+ bind(&neighbor::get_load, _1),
+ bind(&neighbor::get_load, _2)));
+}
+
#endif // !PROCESS_H
// Local variables:
