From: laiymani Date: Mon, 28 Apr 2014 15:26:51 +0000 (+0200) Subject: Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/hpcc2014 X-Git-Tag: hpcc2014_submission~20^2 X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/commitdiff_plain/eee2ce96cdbc6990b0a059a92129c0f547a3dad2?hp=274dcd73fb827d7abedb68a1c1c356ecda43b622 Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/hpcc2014 --- diff --git a/hpcc.tex b/hpcc.tex index e73d2cc..37ad4e3 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -228,13 +228,13 @@ 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 -nodes, inter and intra clusrters bandwith and latency, ....) and of the -algorithm (number of splitting with the multisplitting algorithm), the -multisplitting code will obtain the solution more or less quickly. Or course, +nodes, inter and intra clusrters bandwith and latency, etc.) and of the +algorithm (number of splittings with the multisplitting algorithm), the +multisplitting code will obtain the solution more or less quickly. Of course, the GMRES method also depends of the same parameters. As it is difficult to have access to many clusters, grids or supercomputers with many different network parameters, it is interesting to be able to simulate the behaviors of