From ab8360c25108171f3b2fdbda91fdf9747b5473ad Mon Sep 17 00:00:00 2001 From: Arnaud Giersch Date: Wed, 1 Jun 2011 17:20:38 +0200 Subject: [PATCH] =?utf8?q?Ajout=20d'une=20r=C3=A9f.?= MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit --- supercomp11/supercomp11.tex | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/supercomp11/supercomp11.tex b/supercomp11/supercomp11.tex index b0d23b0..47fde96 100644 --- a/supercomp11/supercomp11.tex +++ b/supercomp11/supercomp11.tex @@ -75,9 +75,11 @@ algorithm which is definitively a reference for many works. In their work, they proved that under classical hypotheses of asynchronous iterative algorithms and a special constraint avoiding \emph{ping-pong} effect, an asynchronous iterative algorithm converge to the uniform load distribution. This work has -been extended by many authors. For example, -DASUD~\cite{cortes+ripoll+cedo+al.2002.asynchronous} propose a version working -with integer load. {\bf Rajouter des choses ici}. +been extended by many authors. For example, Cortés et al., with +DASUD~\cite{cortes+ripoll+cedo+al.2002.asynchronous}, propose a +version working with integer load. This work was later generalized by +the same authors in \cite{cedo+cortes+ripoll+al.2007.convergence}. +{\bf Rajouter des choses ici}. Although the Bertsekas and Tsitsiklis' algorithm describes the condition to ensure the convergence, there is no indication or strategy to really implement -- 2.39.5