From: lilia <lilia@amazigh.bordeaux.inria.fr>
Date: Mon, 28 Apr 2014 15:55:21 +0000 (+0200)
Subject: v13
X-Git-Tag: hpcc2014_submission~13
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/commitdiff_plain/e56b60da53690d349f415b94817a340eefbf0661

v13
---

diff --git a/hpcc.tex b/hpcc.tex
index 2523d89..d85a917 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -666,7 +666,7 @@ that after setting the bandwidth of the  inter cluster network to  \np[Mbit/s]{5
 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