of one GFlops, an efficiency of about \np[\%]{40} is
obtained in asynchronous mode for a matrix size of $62^3$ elements. It is noticed that the result remains
stable even we vary the residual error precision from \np{E-5} to \np{E-9}. By
-increasing the matrix size up to 100 elements, it was necessary to increase the
+increasing the matrix size up to $100^3$ elements, it was necessary to increase the
CPU power of \np[\%]{50} to \np[GFlops]{1.5} to get the algorithm convergence and the same order of asynchronous mode efficiency. Maintaining such processor power but increasing network throughput inter cluster up to
\np[Mbit/s]{50}, the result of efficiency with a relative gain of 2.5 is obtained with
high external precision of \np{E-11} for a matrix size from 110 to 150 side
