Use labels to reference line numbers of algorithm.

[hpcc2014.git] / hpcc.tex

diff --git a/hpcc.tex b/hpcc.tex
index 92d275c49c4245b8cc0a8481a7901084f4495bce..3dd67ef8614cc072037465711a8576e58d6263e2 100644 (file)
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -277,8 +277,8 @@ is solved independently by a cluster and communications are required to update t
 \For {$k=0,1,2,\ldots$ until the global convergence}
 \State Restart outer iteration with $x^0=x^k$
 \State Inner iteration: \Call{InnerSolver}{$x^0$, $k+1$}
 \For {$k=0,1,2,\ldots$ until the global convergence}
 \State Restart outer iteration with $x^0=x^k$
 \State Inner iteration: \Call{InnerSolver}{$x^0$, $k+1$}

-\State Send shared elements of $X_l^{k+1}$ to neighboring clusters
-\State Receive shared elements in $\{X_m^{k+1}\}_{m\neq l}$
+\State\label{algo:01:send} Send shared elements of $X_l^{k+1}$ to neighboring clusters
+\State\label{algo:01:recv} Receive shared elements in $\{X_m^{k+1}\}_{m\neq l}$

 \EndFor
 
 \Statex
 \EndFor
 
 \Statex


@@ -303,9 +303,9 @@ $\{A_{lm}\}_{m\neq l}$ are off-diagonal matrices of sparse matrix $A$ and
 $\{X_m\}_{m\neq l}$ contain vector elements of solution $x$ shared with
 neighboring clusters. At every outer iteration $k$, asynchronous communications
 are performed between processors of the local cluster and those of distant
 $\{X_m\}_{m\neq l}$ contain vector elements of solution $x$ shared with
 neighboring clusters. At every outer iteration $k$, asynchronous communications
 are performed between processors of the local cluster and those of distant

-clusters (lines $6$ and $7$ in Figure~\ref{algo:01}). The shared vector
-elements of the solution $x$ are exchanged by message passing using MPI
-non-blocking communication routines.
+clusters (lines~\ref{algo:01:send} and~\ref{algo:01:recv} in
+Figure~\ref{algo:01}). The shared vector elements of the solution $x$ are
+exchanged by message passing using MPI non-blocking communication routines.

 
 \begin{figure}[!t]
 \centering
 
 \begin{figure}[!t]
 \centering