#ifndef PROCESS_H
#define PROCESS_H
-#include <map>
+#define USE_UNORDERED_MAP 1
+//#undef USE_UNORDERED_MAP
+
#include <vector>
+#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 <msg/msg.h>
+#include <xbt/log.h>
#include "communicator.h"
#include "neighbor.h"
+#include "options.h"
class process {
public:
+ 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[]);
- ~process() { };
+ virtual ~process();
+
+ double get_comp() const { return comp; }
+ double get_load() const { return 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
+
+ // Returns the sum of "to_send" for all neighbors.
+ double sum_of_to_send() const;
+
+ // 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:
- std::vector<neighbor> neigh;
- std::map<m_host_t, neighbor*> rev_neigh;
+ 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
- communicator comm;
- int ctrl_close_pending;
- int data_close_pending;
+ 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
- unsigned iter;
+ 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
- double load;
- double expected_load;
+ unsigned lb_iter; // counter of load-balancing iterations
+ unsigned comp_iter; // counter of computation iterations
- void compute();
+ 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 load; // current load
+ double expected_load; // expected load in bookkeeping mode
+
+ double& lb_load() { return opt::bookkeeping ? expected_load : load; }
+
+ // The load balancing algorithm comes here...
+ // Parameter "my_load" is the load to take into account for myself
+ // (may be load or expected load).
+ // Returns the total load sent to neighbors.
virtual double load_balance(double my_load);
+
+ // Virtually do some computation
+ void compute();
+
+ // Send procedures, with helpers for bookkeeping mode or not
void send1_no_bookkeeping(neighbor& nb);
void send1_bookkeeping(neighbor& nb);
void send();
- bool receive(bool wait_for_close);
+
+ // Returns true if there remains neighbors to listen for
+ bool may_receive() { return ctrl_close_pending || data_close_pending; }
+
+ // Receive procedure: wait (or not) for a message to come
+ void receive(bool wait);
+
+ // Finalize sends a "close" message to each neighbor and wait for
+ // all of them to answer.
void finalize1(neighbor& nb);
void finalize();
- void print_loads(e_xbt_log_priority_t logp = xbt_log_priority_info);
-
- void insert_neighbor_in_map(neighbor& nb);
};
#endif // !PROCESS_H
