X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/b02ac1c736917a89bec0baa4de9afc17cd29777c..6e604bae957c88e7d4375ec965935473f359d9ea:/examples/msg/chord/chord.c

diff --git a/examples/msg/chord/chord.c b/examples/msg/chord/chord.c
index fe9ab9d15a..58aa2987cb 100644
--- a/examples/msg/chord/chord.c
+++ b/examples/msg/chord/chord.c
@@ -12,11 +12,17 @@
 XBT_LOG_NEW_DEFAULT_CATEGORY(msg_chord,
                              "Messages specific for this msg example");
 
-#define NB_BITS 6
-#define NB_KEYS 64
 #define COMM_SIZE 10
 #define COMP_SIZE 0
 
+static int nb_bits = 16;
+static int nb_keys = 0;
+static int timeout = 50;
+static int max_simulation_time = 1000;
+static int periodic_stabilize_delay = 20;
+static int periodic_fix_fingers_delay = 120;
+static int periodic_check_predecessor_delay = 120;
+
 /**
  * Finger element.
  */
@@ -31,12 +37,13 @@ typedef struct finger {
 typedef struct node {
   int id;                                 // my id
   char* mailbox;                          // my usual mailbox name
-  s_finger_t fingers[NB_BITS];            // finger table (fingers[0] is my successor)
+  s_finger_t *fingers;                    // finger table, of size nb_bits (fingers[0] is my successor)
   int pred_id;                            // predecessor id
   char* pred_mailbox;                     // predecessor's mailbox name
   int next_finger_to_fix;                 // index of the next finger to fix in fix_fingers()
   msg_comm_t comm_receive;                // current communication to receive
   xbt_dynar_t comms;                      // current communications being sent
+  double last_change_date;                // last time I changed a finger or my predecessor
 } s_node_t, *node_t;
 
 /**
@@ -60,17 +67,18 @@ typedef struct task_data {
   int request_id;                         // id paramater (used by some types of tasks)
   int request_finger;                     // finger parameter (used by some types of tasks)
   int answer_id;                          // answer (used by some types of tasks)
-  const char* answer_to;                  // mailbox to send an answer to
+  char* answer_to;                        // mailbox to send an answer to (or NULL)
   const char* issuer_host_name;           // used for logging
 } s_task_data_t, *task_data_t;
 
-static int powers2[NB_BITS];
+static int *powers2;
 
 // utility functions
 static void chord_initialize(void);
 static int normalize(int id);
 static int is_in_interval(int id, int start, int end);
 static char* get_mailbox(int host_id);
+static void task_data_destroy(task_data_t task_data);
 static void print_finger_table(node_t node);
 static void set_finger(node_t node, int finger_index, int id);
 static void set_predecessor(node_t node, int predecessor_id);
@@ -100,16 +108,19 @@ static void quit_notify(node_t node, int to);
 static void chord_initialize(void)
 {
   // compute the powers of 2 once for all
+  powers2 = xbt_new(int, nb_bits);
   int pow = 1;
   int i;
-  for (i = 0; i < NB_BITS; i++) {
+  for (i = 0; i < nb_bits; i++) {
     powers2[i] = pow;
     pow = pow << 1;
   }
+  nb_keys = pow;
+  DEBUG1("Sets nb_keys to %d", nb_keys);
 }
 
 /**
- * \brief Turns an id into an equivalent id in [0, NB_KEYS).
+ * \brief Turns an id into an equivalent id in [0, nb_keys).
  * \param id an id
  * \return the corresponding normalized id
  */
@@ -117,10 +128,10 @@ static int normalize(int id)
 {
   // make sure id >= 0
   while (id < 0) {
-    id += NB_KEYS;
+    id += nb_keys;
   }
-  // make sure id < NB_KEYS
-  id = id % NB_KEYS;
+  // make sure id < nb_keys
+  id = id % nb_keys;
 
   return id;
 }
@@ -128,7 +139,7 @@ static int normalize(int id)
 /**
  * \brief Returns whether a id belongs to the interval [start, end].
  *
- * The parameters are noramlized to make sure they are between 0 and CHORD_NB_KEYS - 1).
+ * The parameters are noramlized to make sure they are between 0 and nb_keys - 1).
  * 1 belongs to [62, 3]
  * 1 does not belong to [3, 62]
  * 63 belongs to [62, 3]
@@ -149,11 +160,11 @@ static int is_in_interval(int id, int start, int end)
 
   // make sure end >= start and id >= start
   if (end < start) {
-    end += NB_KEYS;
+    end += nb_keys;
   }
 
   if (id < start) {
-    id += NB_KEYS;
+    id += nb_keys;
   }
 
   return id <= end;
@@ -169,35 +180,50 @@ static char* get_mailbox(int node_id)
   return bprintf("mailbox%d", node_id);
 }
 
+/**
+ * \brief Frees the memory used by some task data.
+ * \param task_data the task data to destroy
+ */
+static void task_data_destroy(task_data_t task_data)
+{
+  xbt_free(task_data->answer_to);
+  xbt_free(task_data);
+}
+
 /**
  * \brief Displays the finger table of a node.
  * \param node a node
  */
 static void print_finger_table(node_t node)
 {
-  int i;
-  int pow = 1;
-  INFO0("My finger table:");
-  INFO0("Start | Succ ");
-  for (i = 0; i < NB_BITS; i++) {
-    INFO2(" %3d  | %3d ", (node->id + pow) % NB_KEYS, node->fingers[i].id);
-    pow = pow << 1;
+  if (XBT_LOG_ISENABLED(msg_chord, xbt_log_priority_verbose)) {
+    int i;
+    int pow = 1;
+    VERB0("My finger table:");
+    VERB0("Start | Succ ");
+    for (i = 0; i < nb_bits; i++) {
+      VERB2(" %3d  | %3d ", (node->id + pow) % nb_keys, node->fingers[i].id);
+      pow = pow << 1;
+    }
+    VERB1("Predecessor: %d", node->pred_id);
   }
-  INFO1("Predecessor: %d", node->pred_id);
 }
 
 /**
  * \brief Sets a finger of the current node.
  * \param node the current node
- * \param finger_index index of the finger to set (0 to NB_BITS - 1)
+ * \param finger_index index of the finger to set (0 to nb_bits - 1)
  * \param id the id to set for this finger
  */
 static void set_finger(node_t node, int finger_index, int id)
 {
-  node->fingers[finger_index].id = id;
-  xbt_free(node->fingers[finger_index].mailbox);
-  node->fingers[finger_index].mailbox = get_mailbox(id);
-  DEBUG2("My new finger #%d is %d", finger_index, id);
+  if (id != node->fingers[finger_index].id) {
+    node->fingers[finger_index].id = id;
+    xbt_free(node->fingers[finger_index].mailbox);
+    node->fingers[finger_index].mailbox = get_mailbox(id);
+    node->last_change_date = MSG_get_clock();
+    DEBUG2("My new finger #%d is %d", finger_index, id);
+  }
 }
 
 /**
@@ -207,14 +233,17 @@ static void set_finger(node_t node, int finger_index, int id)
  */
 static void set_predecessor(node_t node, int predecessor_id)
 {
-  node->pred_id = predecessor_id;
-  xbt_free(node->pred_mailbox);
+  if (predecessor_id != node->pred_id) {
+    node->pred_id = predecessor_id;
+    xbt_free(node->pred_mailbox);
 
-  if (predecessor_id != -1) {
-    node->pred_mailbox = get_mailbox(predecessor_id);
-  }
+    if (predecessor_id != -1) {
+      node->pred_mailbox = get_mailbox(predecessor_id);
+    }
+    node->last_change_date = MSG_get_clock();
 
-  DEBUG1("My new predecessor is %d", predecessor_id);
+    DEBUG1("My new predecessor is %d", predecessor_id);
+  }
 }
 
 /**
@@ -246,8 +275,10 @@ int node(int argc, char *argv[])
   node.mailbox = get_mailbox(node.id);
   node.next_finger_to_fix = 0;
   node.comms = xbt_dynar_new(sizeof(msg_comm_t), NULL);
+  node.fingers = xbt_new0(s_finger_t, nb_bits);
+  node.last_change_date = MSG_get_clock();
 
-  for (i = 0; i < NB_BITS; i++) {
+  for (i = 0; i < nb_bits; i++) {
     set_finger(&node, i, node.id);
   }
 
@@ -258,19 +289,23 @@ int node(int argc, char *argv[])
   }
   else {
     int known_id = atoi(argv[2]);
-    double sleep_time = atof(argv[3]);
+    //double sleep_time = atof(argv[3]);
     deadline = atof(argv[4]);
 
+    /*
     // sleep before starting
     DEBUG1("Let's sleep during %f", sleep_time);
     MSG_process_sleep(sleep_time);
+    */
     DEBUG0("Hey! Let's join the system.");
 
     join_success = join(&node, known_id);
   }
 
   if (join_success) {
-    while (MSG_get_clock() < init_time + deadline) {
+    while (MSG_get_clock() < init_time + deadline
+//	&& MSG_get_clock() < node.last_change_date + 1000
+	&& MSG_get_clock() < max_simulation_time) {
 
       if (node.comm_receive == NULL) {
         task_received = NULL;
@@ -283,15 +318,15 @@ int node(int argc, char *argv[])
         // no task was received: make some periodic calls
         if (MSG_get_clock() >= next_stabilize_date) {
           stabilize(&node);
-          next_stabilize_date = MSG_get_clock() + 10;
+          next_stabilize_date = MSG_get_clock() + periodic_stabilize_delay;
         }
         else if (MSG_get_clock() >= next_fix_fingers_date) {
           fix_fingers(&node);
-          next_fix_fingers_date = MSG_get_clock() + 10;
+          next_fix_fingers_date = MSG_get_clock() + periodic_fix_fingers_delay;
         }
         else if (MSG_get_clock() >= next_check_predecessor_date) {
           check_predecessor(&node);
-          next_check_predecessor_date = MSG_get_clock() + 10;
+          next_check_predecessor_date = MSG_get_clock() + periodic_check_predecessor_delay;
         }
         else {
           // nothing to do: sleep for a while
@@ -302,14 +337,15 @@ int node(int argc, char *argv[])
         // a transfer has occured
 
         MSG_error_t status = MSG_comm_get_status(node.comm_receive);
-        MSG_comm_destroy(node.comm_receive);
-        node.comm_receive = NULL;
 
         if (status != MSG_OK) {
           DEBUG0("Failed to receive a task. Nevermind.");
+          node.comm_receive = NULL;
         }
         else {
           // the task was successfully received
+          MSG_comm_destroy(node.comm_receive);
+          node.comm_receive = NULL;
           handle_task(&node, task_received);
         }
       }
@@ -330,7 +366,7 @@ int node(int argc, char *argv[])
     xbt_dynar_foreach(node.comms, cursor, comm_send) {
       task = MSG_comm_get_task(comm_send);
       MSG_task_cancel(task);
-      xbt_free(MSG_task_get_data(task));
+      task_data_destroy(MSG_task_get_data(task));
       MSG_task_destroy(task);
       MSG_comm_destroy(comm_send);
       // FIXME: the task is actually not destroyed because MSG thinks that the other side (whose process is dead) is still using it
@@ -344,9 +380,10 @@ int node(int argc, char *argv[])
   xbt_dynar_free(&node.comms);
   xbt_free(node.mailbox);
   xbt_free(node.pred_mailbox);
-  for (i = 0; i < NB_BITS - 1; i++) {
+  for (i = 0; i < nb_bits - 1; i++) {
     xbt_free(node.fingers[i].mailbox);
   }
+  xbt_free(node.fingers);
   return 0;
 }
 
@@ -373,11 +410,11 @@ static void handle_task(node_t node, m_task_t task) {
       if (is_in_interval(task_data->request_id, node->id + 1, node->fingers[0].id)) {
         task_data->type = TASK_FIND_SUCCESSOR_ANSWER;
         task_data->answer_id = node->fingers[0].id;
-        comm = MSG_task_isend(task, task_data->answer_to);
-        xbt_dynar_push(node->comms, &comm);
         DEBUG3("Sending back a 'Find Successor Answer' to %s: the successor of %d is %d",
             task_data->issuer_host_name,
             task_data->request_id, task_data->answer_id);
+        comm = MSG_task_isend(task, task_data->answer_to);
+        xbt_dynar_push(node->comms, &comm);
       }
       else {
         // otherwise, forward the request to the closest preceding finger in my table
@@ -395,18 +432,18 @@ static void handle_task(node_t node, m_task_t task) {
       DEBUG1("Receiving a 'Get Predecessor' request from %s", task_data->issuer_host_name);
       task_data->type = TASK_GET_PREDECESSOR_ANSWER;
       task_data->answer_id = node->pred_id;
-      comm = MSG_task_isend(task, task_data->answer_to);
-      xbt_dynar_push(node->comms, &comm);
       DEBUG3("Sending back a 'Get Predecessor Answer' to %s via mailbox '%s': my predecessor is %d",
           task_data->issuer_host_name,
           task_data->answer_to, task_data->answer_id);
+      comm = MSG_task_isend(task, task_data->answer_to);
+      xbt_dynar_push(node->comms, &comm);
       break;
 
     case TASK_NOTIFY:
       // someone is telling me that he may be my new predecessor
       DEBUG1("Receiving a 'Notify' request from %s", task_data->issuer_host_name);
       notify(node, task_data->request_id);
-      xbt_free(task_data);
+      task_data_destroy(task_data);
       MSG_task_destroy(task);
       break;
 
@@ -415,7 +452,7 @@ static void handle_task(node_t node, m_task_t task) {
       DEBUG1("Receiving a 'Predecessor Leaving' message from %s", task_data->issuer_host_name);
       // modify my predecessor
       set_predecessor(node, task_data->request_id);
-      xbt_free(task_data);
+      task_data_destroy(task_data);
       MSG_task_destroy(task);
       /*TODO :
       >> notify my new predecessor
@@ -428,16 +465,17 @@ static void handle_task(node_t node, m_task_t task) {
       DEBUG1("Receiving a 'Successor Leaving' message from %s", task_data->issuer_host_name);
       // modify my successor FIXME : this should be implicit ?
       set_finger(node, 0, task_data->request_id);
-      xbt_free(task_data);
+      task_data_destroy(task_data);
       MSG_task_destroy(task);
       /* TODO
       >> notify my new successor
       >> update my table & predecessors table */
       break;
 
-    default:
-      CRITICAL1("Received an unexpected task: %d", type);
-      //xbt_abort();
+    case TASK_FIND_SUCCESSOR_ANSWER:
+    case TASK_GET_PREDECESSOR_ANSWER:
+      DEBUG2("Ignoring unexpected task of type %d (%p)", type, task);
+      break;
   }
 }
 
@@ -466,7 +504,7 @@ static int join(node_t node, int known_id)
 
   int successor_id = remote_find_successor(node, known_id, node->id);
   if (successor_id == -1) {
-    DEBUG0("Cannot join the ring.");
+    INFO0("Cannot join the ring.");
   }
   else {
     set_finger(node, 0, successor_id);
@@ -503,6 +541,7 @@ static void quit_notify(node_t node, int to)
   req_data->successor_id = node->fingers[0].id;
   req_data->pred_id = node->pred_id;
   req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
+  req_data->answer_to = NULL;
   const char* task_name = NULL;
   const char* to_mailbox = NULL;
   if (to == 1) {    // notify my successor
@@ -562,52 +601,57 @@ static int remote_find_successor(node_t node, int ask_to, int id)
   task_data_t req_data = xbt_new0(s_task_data_t, 1);
   req_data->type = TASK_FIND_SUCCESSOR;
   req_data->request_id = id;
-  req_data->answer_to =  node->mailbox;
+  req_data->answer_to = xbt_strdup(node->mailbox);
   req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
 
   // send a "Find Successor" request to ask_to_id
-  m_task_t task = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
-  DEBUG3("Sending a 'Find Successor' request (task %p) to %d for id %d", task, ask_to, id);
-  MSG_error_t res = MSG_task_send_with_timeout(task, mailbox, 50);
+  m_task_t task_sent = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
+  DEBUG3("Sending a 'Find Successor' request (task %p) to %d for id %d", task_sent, ask_to, id);
+  MSG_error_t res = MSG_task_send_with_timeout(task_sent, mailbox, timeout);
 
   if (res != MSG_OK) {
-    DEBUG2("Failed to send the 'Find Successor' request to %d for id %d", ask_to, id);
-    MSG_task_destroy(task);
-    xbt_free(req_data);
+    DEBUG3("Failed to send the 'Find Successor' request (task %p) to %d for id %d",
+        task_sent, ask_to, id);
+    MSG_task_destroy(task_sent);
+    task_data_destroy(req_data);
   }
   else {
 
     // receive the answer
     DEBUG3("Sent a 'Find Successor' request (task %p) to %d for key %d, waiting for the answer",
-        task, ask_to, id);
+        task_sent, ask_to, id);
 
     do {
       if (node->comm_receive == NULL) {
-        task = NULL;
-        node->comm_receive = MSG_task_irecv(&task, node->mailbox);
+        m_task_t task_received = NULL;
+        node->comm_receive = MSG_task_irecv(&task_received, node->mailbox);
       }
 
-      res = MSG_comm_wait(node->comm_receive, 50);
+      res = MSG_comm_wait(node->comm_receive, timeout);
 
       if (res != MSG_OK) {
-        DEBUG2("Failed to receive the answer to my 'Find Successor' request (task %p): %d", task, res);
+        DEBUG2("Failed to receive the answer to my 'Find Successor' request (task %p): %d",
+            task_sent, res);
         stop = 1;
-//      MSG_comm_destroy(node->comm_receive);
+        //MSG_comm_destroy(node->comm_receive);
       }
       else {
-        task = MSG_comm_get_task(node->comm_receive);
-        task_data_t ans_data = MSG_task_get_data(task);
+        m_task_t task_received = MSG_comm_get_task(node->comm_receive);
+        DEBUG1("Received a task (%p)", task_received);
+        task_data_t ans_data = MSG_task_get_data(task_received);
 
-        if (ans_data->type != TASK_FIND_SUCCESSOR_ANSWER) {
-          handle_task(node, task);
+        if (task_received != task_sent) {
+          // this is not the expected answer
+          handle_task(node, task_received);
         }
         else {
-          DEBUG3("Received the answer to my 'Find Successor' request (task %p): the successor of key %d is %d",
-              task, id, successor);
+          // this is our answer
+          DEBUG4("Received the answer to my 'Find Successor' request for id %d (task %p): the successor of key %d is %d",
+              ans_data->request_id, task_received, id, ans_data->answer_id);
           successor = ans_data->answer_id;
           stop = 1;
-          MSG_task_destroy(task);
-          xbt_free(req_data);
+          MSG_task_destroy(task_received);
+          task_data_destroy(req_data);
         }
       }
       node->comm_receive = NULL;
@@ -632,50 +676,54 @@ static int remote_get_predecessor(node_t node, int ask_to)
   char* mailbox = get_mailbox(ask_to);
   task_data_t req_data = xbt_new0(s_task_data_t, 1);
   req_data->type = TASK_GET_PREDECESSOR;
-  req_data->answer_to = node->mailbox;
+  req_data->answer_to = xbt_strdup(node->mailbox);
   req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
 
   // send a "Get Predecessor" request to ask_to_id
   DEBUG1("Sending a 'Get Predecessor' request to %d", ask_to);
-  m_task_t task = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
-  MSG_error_t res = MSG_task_send_with_timeout(task, mailbox, 50);
+  m_task_t task_sent = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
+  MSG_error_t res = MSG_task_send_with_timeout(task_sent, mailbox, timeout);
 
   if (res != MSG_OK) {
-    DEBUG1("Failed to send the 'Get Predecessor' request to %d", ask_to);
-    MSG_task_destroy(task);
-    xbt_free(req_data);
+    DEBUG2("Failed to send the 'Get Predecessor' request (task %p) to %d",
+        task_sent, ask_to);
+    MSG_task_destroy(task_sent);
+    task_data_destroy(req_data);
   }
   else {
 
     // receive the answer
-    DEBUG2("Sent 'Get Predecessor' request to %d, waiting for the answer on my mailbox '%s'", ask_to, req_data->answer_to);
+    DEBUG3("Sent 'Get Predecessor' request (task %p) to %d, waiting for the answer on my mailbox '%s'",
+        task_sent, ask_to, req_data->answer_to);
 
     do {
       if (node->comm_receive == NULL) { // FIXME simplify this
-        task = NULL;
-        node->comm_receive = MSG_task_irecv(&task, node->mailbox);
+        m_task_t task_received = NULL;
+        node->comm_receive = MSG_task_irecv(&task_received, node->mailbox);
       }
 
-      res = MSG_comm_wait(node->comm_receive, 50);
+      res = MSG_comm_wait(node->comm_receive, timeout);
 
       if (res != MSG_OK) {
-        DEBUG1("Failed to receive the answer to my 'Get Predecessor' request: %d", res);
+        DEBUG2("Failed to receive the answer to my 'Get Predecessor' request (task %p): %d",
+            task_sent, res);
         stop = 1;
-//        MSG_comm_destroy(node->comm_receive);
+        //MSG_comm_destroy(node->comm_receive);
       }
       else {
-        task = MSG_comm_get_task(node->comm_receive);
-        task_data_t ans_data = MSG_task_get_data(task);
+        m_task_t task_received = MSG_comm_get_task(node->comm_receive);
+        task_data_t ans_data = MSG_task_get_data(task_received);
 
-        if (ans_data->type != TASK_GET_PREDECESSOR_ANSWER) {
-          handle_task(node, task);
+        if (task_received != task_sent) {
+          handle_task(node, task_received);
         }
         else {
-          DEBUG2("Received the answer to my 'Get Predecessor' request: the predecessor of node %d is %d", ask_to, predecessor_id);
+          DEBUG3("Received the answer to my 'Get Predecessor' request (task %p): the predecessor of node %d is %d",
+              task_received, ask_to, ans_data->answer_id);
           predecessor_id = ans_data->answer_id;
           stop = 1;
-          MSG_task_destroy(task);
-          xbt_free(req_data);
+          MSG_task_destroy(task_received);
+          task_data_destroy(req_data);
         }
       }
       node->comm_receive = NULL;
@@ -696,7 +744,7 @@ static int remote_get_predecessor(node_t node, int ask_to)
 int closest_preceding_node(node_t node, int id)
 {
   int i;
-  for (i = NB_BITS - 1; i >= 0; i--) {
+  for (i = nb_bits - 1; i >= 0; i--) {
     if (is_in_interval(node->fingers[i].id, node->id + 1, id - 1)) {
       return node->fingers[i].id;
     }
@@ -763,10 +811,11 @@ static void remote_notify(node_t node, int notify_id, int predecessor_candidate_
   req_data->type = TASK_NOTIFY;
   req_data->request_id = predecessor_candidate_id;
   req_data->issuer_host_name = MSG_host_get_name(MSG_host_self());
+  req_data->answer_to = NULL;
 
   // send a "Notify" request to notify_id
-  DEBUG1("Sending a 'Notify' request to %d", notify_id);
   m_task_t task = MSG_task_create(NULL, COMP_SIZE, COMM_SIZE, req_data);
+  DEBUG2("Sending a 'Notify' request (task %p) to %d", task, notify_id);
   char* mailbox = get_mailbox(notify_id);
   msg_comm_t comm = MSG_task_isend(task, mailbox);
   xbt_dynar_push(node->comms, &comm);
@@ -789,7 +838,7 @@ static void fix_fingers(node_t node) {
       set_finger(node, i, id);
       print_finger_table(node);
     }
-    node->next_finger_to_fix = (i + 1) % NB_BITS;
+    node->next_finger_to_fix = (i + 1) % nb_bits;
   }
 }
 
@@ -810,17 +859,40 @@ static void check_predecessor(node_t node)
 int main(int argc, char *argv[])
 {
   if (argc < 3) {
-    printf("Usage: %s platform_file deployment_file\n", argv[0]);
+    printf("Usage: %s [-nb_bits=n] [-timeout=t] platform_file deployment_file\n", argv[0]);
     printf("example: %s ../msg_platform.xml chord.xml\n", argv[0]);
     exit(1);
   }
 
-  const char* platform_file = argv[1];
-  const char* application_file = argv[2];
+  MSG_global_init(&argc, argv);
+
+  char **options = &argv[1];
+  while (!strncmp(options[0], "-", 1)) {
+
+    int length = strlen("-nb_bits=");
+    if (!strncmp(options[0], "-nb_bits=", length) && strlen(options[0]) > length) {
+      nb_bits = atoi(options[0] + length);
+      DEBUG1("Set nb_bits to %d", nb_bits);
+    }
+    else {
+
+      length = strlen("-timeout=");
+      if (!strncmp(options[0], "-timeout=", length) && strlen(options[0]) > length) {
+	timeout = atoi(options[0] + length);
+	DEBUG1("Set timeout to %d", timeout);
+      }
+      else {
+	xbt_assert1(0, "Invalid chord option '%s'", options[0]);
+      }
+    }
+    options++;
+  }
+
+  const char* platform_file = options[0];
+  const char* application_file = options[1];
 
   chord_initialize();
 
-  MSG_global_init(&argc, argv);
   MSG_set_channel_number(0);
   MSG_create_environment(platform_file);