From b680616f7e0702003982aa20fd7208c18eba98f1 Mon Sep 17 00:00:00 2001 From: Arnaud Giersch Date: Fri, 1 Apr 2011 15:25:45 +0200 Subject: [PATCH] Make some citations. --- supercomp11/supercomp11.tex | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/supercomp11/supercomp11.tex b/supercomp11/supercomp11.tex index 4e1509f..f975555 100644 --- a/supercomp11/supercomp11.tex +++ b/supercomp11/supercomp11.tex @@ -31,7 +31,8 @@ \begin{abstract} Most of the time, asynchronous load balancing algorithms have extensively been -studied in a theoretical point of view. The Bertsekas and Tsitsiklis' algorithm +studied in a theoretical point of view. The Bertsekas and Tsitsiklis' +algorithm~\cite[section~7.4]{bertsekas+tsitsiklis.1997.parallel} 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 @@ -68,8 +69,9 @@ 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 \texttt{ping-pong} effect, an asynchronous iterative algorithm converge to the uniform load distribution. This work has -been extended by many authors. For example, DASUD propose a version working with -integer load. +been extended by many authors. For example, +DASUD~\cite{cortes+ripoll+cedo+al.2002.asynchronous} propose a version working +with integer load. \bibliographystyle{spmpsci} -- 2.39.5