From 71e9a817e3b9fe1daf0e108ff31cdbaba31197ff Mon Sep 17 00:00:00 2001 From: lilia Date: Mon, 28 Apr 2014 17:10:03 +0200 Subject: [PATCH 1/1] v1 --- hpcc.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/hpcc.tex b/hpcc.tex index 306cf68..fdd60b2 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -103,7 +103,7 @@ suggests, these algorithms solve a given problem by successive iterations ($X_{n $X_{0}$ to find an approximate value $X^*$ of the solution with a very low residual error. Several well-known methods demonstrate the convergence of these algorithms~\cite{BT89,Bahi07}. -Parallelization of such algorithms generally involve the division of the problem +Parallelization of such algorithms generally involves the division of the problem into several \emph{blocks} that will be solved in parallel on multiple processing units. The latter will communicate each intermediate results before a new iteration starts and until the approximate solution is reached. These -- 2.39.5