From bcf6cef9fa1df52f632849a68fc08e41f6163bb1 Mon Sep 17 00:00:00 2001 From: couturie Date: Thu, 9 Jun 2011 09:39:04 +0200 Subject: [PATCH] quelques coquilles... --- supercomp11/supercomp11.tex | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/supercomp11/supercomp11.tex b/supercomp11/supercomp11.tex index 47fde96..81ee704 100644 --- a/supercomp11/supercomp11.tex +++ b/supercomp11/supercomp11.tex @@ -185,12 +185,13 @@ condition or with a weaker condition. \section{Best effort strategy} \label{Best-effort} -We will describe here a new load-balancing strategy that we called -\emph{best effort}. The general idea behind this strategy is, for a -processor, to send some load to the most of its neighbors, doing its +In this section we describe a new load-balancing strategy that we call +\emph{best effort}. The general idea behind this strategy is that each +processor, that detects it has more load than some of its neighbors, +sends some load to the most of its less loaded neighbors, doing its best to reach the equilibrium between those neighbors and himself. -More precisely, when a processors $i$ is in its load-balancing phase, +More precisely, when a processor $i$ is in its load-balancing phase, he proceeds as following. \begin{enumerate} \item First, the neighbors are sorted in non-decreasing order of their -- 2.39.5