From fe2acffc0f8d127cdeb32859d2666897c00f0058 Mon Sep 17 00:00:00 2001 From: lilia Date: Mon, 28 Apr 2014 17:54:43 +0200 Subject: [PATCH] v12 --- hpcc.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/hpcc.tex b/hpcc.tex index dc76042..2523d89 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -664,7 +664,7 @@ asynchronous multisplitting compared to GMRES with two distant clusters. With these settings, Table~\ref{tab.cluster.2x50} shows that after setting the bandwidth of the inter cluster network to \np[Mbit/s]{5} and a latency in order of one hundredth of millisecond and a processor power of one GFlops, an efficiency of about \np[\%]{40} is -obtained in asynchronous mode for a matrix size of 62 elements. It is noticed that the result remains +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 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 -- 2.39.5