Add .dir-locals.el.

[loba-papers.git] / loba-besteffort / loba-besteffort.tex

diff --git a/loba-besteffort/loba-besteffort.tex b/loba-besteffort/loba-besteffort.tex
index b94b8ef2e76e45baa25823de79594738fbde7fb0..36505d186d779d73444c2aabf8a5d5bed28e116d 100644 (file)
--- a/loba-besteffort/loba-besteffort.tex
+++ b/loba-besteffort/loba-besteffort.tex
@@ -56,9 +56,7 @@
 \begin{abstract}
   Most of the time, asynchronous load balancing algorithms are extensively 
   studied from a theoretical point of view. The Bertsekas and Tsitsiklis'
 \begin{abstract}
   Most of the time, asynchronous load balancing algorithms are extensively 
   studied from a theoretical point of view. The Bertsekas and Tsitsiklis'

-  algorithm~\cite
-  %[section~7.4]
-  {bertsekas+tsitsiklis.1997.parallel} is undeniably the best known algorithm for which the asymptotic convergence proof is given. 
+  algorithm~\cite{bertsekas+tsitsiklis.1997.parallel} is undeniably the best known algorithm for which the asymptotic convergence proof is given. 

   From a
   practical point of view, when a node needs to balance a part of its load to
   some of its neighbors, the algorithm's description is unfortunately too succinct, and no details are given on what is really sent and how the load balancing decisions are taken. In this paper, we
   From a
   practical point of view, when a node needs to balance a part of its load to
   some of its neighbors, the algorithm's description is unfortunately too succinct, and no details are given on what is really sent and how the load balancing decisions are taken. In this paper, we


@@ -68,8 +66,7 @@
   and their variations \cite{bcvc07:bc}, both load transfer and load information messages are dissociated. 
   To speedup the convergence time of the load balancing process, we propose {\it a clairvoyant virtual load} heuristic. This heuristic allows a node receiving a load
   information message to integrate the future virtual load (if any) in its load's list, even if the load has not been received yet. This leads to have predictive snapshots of nodes' loads at each iteration of the load balancing process.  Consequently, the notified node sends a real part of its load to some of
   and their variations \cite{bcvc07:bc}, both load transfer and load information messages are dissociated. 
   To speedup the convergence time of the load balancing process, we propose {\it a clairvoyant virtual load} heuristic. This heuristic allows a node receiving a load
   information message to integrate the future virtual load (if any) in its load's list, even if the load has not been received yet. This leads to have predictive snapshots of nodes' loads at each iteration of the load balancing process.  Consequently, the notified node sends a real part of its load to some of

-  its neighbors taking into account the virtual load it will receive in the subsequent time-steps. Based on the SimGrid simulator, some series of test-bed scenarios are considered and several QoS metrics are evaluated to show the usefulness of the proposed algorithm.  %In order to validate our approaches, we have defined a
- % simulator based on SimGrid which allowed us to conduct many experiments.
+  its neighbors taking into account the virtual load it will receive in the subsequent time-steps. Based on the SimGrid simulator, some series of test-bed scenarios are considered and several QoS metrics are evaluated to show the usefulness of the proposed algorithm.

 \end{abstract}
 
 % \begin{keywords}
 \end{abstract}
 
 % \begin{keywords}