[sharelatex-git-integration Best effort strategy and virtual load for asynchronous...

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}

diff --git a/loba-besteffort/review.tex b/loba-besteffort/review.tex
new file mode 100644 (file)
index 0000000..78316e6
--- /dev/null
+++ b/loba-besteffort/review.tex
@@ -0,0 +1,72 @@
+\documentclass[11pt]{article}
+\usepackage{graphicx}
+\usepackage[english]{babel}
+\usepackage{amsmath}
+\usepackage{mathtools}
+\begin{document}
+
+\title{Summary of changes}
+\author{\textit{Best effort strategy and virtual load for  asynchronous iterative load balancing}}
+
+\date{}
+\maketitle
+
+\textbf{We thank the editor and both reviewers for their valuable comments and efforts which helped us improve this paper. Below, some details and answers are provided corresponding to their comments.}
+ 
+
+\vspace{1cm}
+%\tableofcontents
+
+
+
+%\newpage
+
+\section*{Reviewer  1}
+
+\vspace{0.3cm}
+
+\textit{ The paper considers asynchronous load balancing algorithms based on
+earlier work by Bertsekas and Tsitsiklis.
+A new best effort strategy is proposed that tries to balance the load
+of a node by sending some load to neighboring nodes with less load.
+The goal is an even distribution of the load.
+Load information messages are used between neighboring nodes to enable these
+neighboring nodes to determine the amount of load to distribute in case of a
+currently uneven distribution.
+An experimental evaluation is provided using the SimGrid framework for different
+topologies (line, torus, cube).}
+
+\textit{
+The paper is generally well written and addresses a useful problem.
+The new algorithm is described in detail and it provides advantages over
+the previous algorithm by Bertsekas and Tsitsiklis.
+The experimental evaluation with SimGrid is detailed.
+It would have been interesting to see a comparison with some of the more recent
+load balancing algorithms described in the section on related work, see
+references [7,9,24] as examples.
+The paper needs some proof-reading due to several typos.
+Nevertheless, the paper is suitable for publication.}
+
+
+\textbf{BLABLALA}
+
+\vspace{0.3cm}
+
+\newpage
+\section*{Reviewer  2}
+\textit{This paper is about a practical implementation of a strategy for iterative load balancing using a best effort strategy. The idea is to send data to the neighbors that are under the average load in order to obtain that each neighbor has exactly the average.\\
+To avoid the ping-pong effect they use a k-factor to reduce the amount of load. They also distinguish between control message (metadata about the load that is going to be exchanged) and data message (actual exchanged load) that allows to have a more precise and fast estimation of the load at a given time.\\
+The experiments are convincing and I like very much the discussion about the data and the conclusion drawn from them. I think the authors did a very good job in that aspect. }
+
+\subsection*{Request 1: My only concern is the section 5.2. I did not understand clearly what is this k-factor. The authors say, "Roughly speaking...", I do not what a fuzzy explanation but I need a correct, precise and operational description of that aspect of the work. I think the authors should present a clear explanation of what they do.     
+}
+
+\textbf{BLABLALA}
+
+
+
+\end{document}
+
+
+
+