From: lilia Date: Mon, 28 Apr 2014 15:18:50 +0000 (+0200) Subject: v2 X-Git-Tag: hpcc2014_submission~25 X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/commitdiff_plain/7845b6502c9948b08bc33b38b0ac5293125e565e?ds=inline;hp=--cc v2 --- 7845b6502c9948b08bc33b38b0ac5293125e565e diff --git a/hpcc.tex b/hpcc.tex index fdd60b2..b2509c1 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -228,7 +228,7 @@ In the context of asynchronous algorithms, the number of iterations to reach the convergence depends on the delay of messages. With synchronous iterations, the number of iterations is exactly the same than in the sequential mode (if the parallelization process does not change the algorithm). So the difficulty with -asynchronous iteratie algorithms comes from the fact it is necessary to run the algorithm +asynchronous iterative algorithms comes from the fact it is necessary to run the algorithm with real data. In fact, from an execution to another the order of messages will change and the number of iterations to reach the convergence will also change. According to all the parameters of the platform (number of nodes, power of