From: lilia Date: Sat, 9 May 2015 10:56:01 +0000 (+0200) Subject: petites modifs intro X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/commitdiff_plain/62128989cc887a6e82f6feb1dd82c00367eba78c?ds=sidebyside;hp=--cc petites modifs intro --- 62128989cc887a6e82f6feb1dd82c00367eba78c diff --git a/paper.tex b/paper.tex index 49480a8..e72fa2e 100644 --- a/paper.tex +++ b/paper.tex @@ -154,7 +154,7 @@ iteration without having to wait for the data dependencies coming from its neighbors. Both communications and computations are \textit{asynchronous} inducing that there is no more idle time, due to synchronizations, between two iterations~\cite{bcvc06:ij}. This model presents some advantages and drawbacks -that we detail in Section~\ref{sec:asynchro} but even if the number of +that we detail in Section~\ref{sec:asynchro}. Even if the number of iterations required to converge is generally greater than for the synchronous case, it appears that the asynchronous iterative scheme can significantly reduce overall execution times by suppressing idle times due to @@ -181,7 +181,7 @@ multisplitting algorithm with the GMRES (Generalized Minimal RESidual) solver~\cite{saad86} in synchronous mode. The simulation results allow us to determine which method to choose for a given multi-core architecture. Moreover the obtained results on different simulated multi-core architectures -confirm the real results previously obtained on non simulated architectures. +confirm the real results previously obtained on real physical architectures. More precisely the simulated results are in accordance (i.e. with the same order of magnitude) with the works presented in~\cite{couturier15}, which show that the synchronous Krylov multisplitting method is more efficient than GMRES for large