#include <xbt/log.h>
#include "communicator.h"
#include "neighbor.h"
+#include "options.h"
class process {
public:
process(int argc, char* argv[]);
virtual ~process();
+ double get_comp() const { return comp; }
+ double get_load() const { return load; }
+
int run();
protected:
private:
static double total_load_init; // sum of process loads at init
- static double total_load_running; // summ of loads while running
+ 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;
int data_close_pending; // number of "close" messages to wait
// on data channel
bool close_received; // true if we received a "close" message
- bool may_receive; // true if there remains neighbors to listen for
bool finalizing; // true when finalize() is running
- unsigned iter; // counter of iterations
+ 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 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.
- enum recv_wait_mode { NO_WAIT = 0, WAIT, WAIT_FOR_CLOSE };
- void 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.
