
\documentclass[smallextended]{svjour3}
\usepackage{graphicx}

\begin{document}

\title{Best effort strategy and virtual load for asynchronous iterative load balancing}

\author{Raphaël Couturier \and
        Arnaud Giersch \and
        Abderrahmane Sider
}

\institute{F. Author \at
              first address \\
              Tel.: +123-45-678910\\
              Fax: +123-45-678910\\
              \email{fauthor@example.com}           %  \\
%             \emph{Present address:} of F. Author  %  if needed
           \and
           S. Author \at
              second address
}

\maketitle


\begin{abstract}

Most of the  time, asynchronous load balancing algorithms  have extensively been
studied in  a theoretical point of  view. The Bertsekas'  algorithm is certainly
the most well  known algorithm for which the convergence proof  is given. From a
practical point of view, when a node wants to balance a part of its load to some
of its  neighbors, the strategy is not  described.  In this paper,  we propose a
strategy called \texttt{best  effort} which tries to balance the  load of a node
to all its less loaded neighbors  while ensuring that all the nodes concerned by
the load balancing  phase have the same amount  of load.  Moreover, asynchronous
iterative  algorithms  in which  an  asynchronous  load  balancing algorithm  is
implemented most of  the time can dissociate messages  concerning load transfers
and message concerning load information.  In order to increase the converge of a
load balancing  algorithm, we propose a simple  heuristic called \texttt{virtual
  load}  which  allows a  node  that receives  an  load  information message  to
integrate  the load  that it  will receive  latter in  its load  (virtually) and
consequently sends a (real) part of its  load to some of its neighbors. In order
to validate our  approaches, we have defined a simulator  based on SimGrid which
allowed us to conduct many experiments.


\end{abstract}




qsdqsd




\end{document}
