# 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:
// 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:
- typedef MAP_TEMPLATE<m_host_t, neighbor*> rev_neigh_type;
+ 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
// 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
- unsigned iter; // counter of 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 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).
void send1_bookkeeping(neighbor& nb);
void send();
- // Receive procedure: wait (or not) for a message to come.
- // Returns false if some "close" message was received, returns true
- // otherwise.
- enum recv_wait_mode { NO_WAIT = 0, WAIT, WAIT_FOR_CLOSE };
- bool receive(recv_wait_mode wait);
+ // Returns true if there remains neighbors to listen for
+ bool may_receive() { return ctrl_close_pending || data_close_pending; }
+
+ // Receive procedure
+ // Parameter "timeout" may be 0 for non-blocking operation, -1 for
+ // infinite waiting, or any positive timeout.
+ void receive(double timeout);
// Finalize sends a "close" message to each neighbor and wait for
// all of them to answer.
void finalize1(neighbor& nb);
void finalize();
-
- // Print with given priority what we know about our neighbors' loads
- void print_loads(e_xbt_log_priority_t logp = xbt_log_priority_info);
};
#endif // !PROCESS_H
