X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/8873e8d5fdf0737801b25abfbdea45ec4340ad2a..a091bb5ea8523eab4cda5bd035da309c347c95e5:/hpcc.tex?ds=sidebyside

diff --git a/hpcc.tex b/hpcc.tex
index e9433c7..c3a0b34 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -318,7 +318,21 @@ exchanged by message passing using MPI non-blocking communication routines.
 \label{fig:4.1}
 \end{figure}
 
-The global convergence of the asynchronous multisplitting solver is detected when the clusters of processors have all converged locally. We implemented the global convergence detection process as follows. On each cluster a master processor is designated (for example the processor with rank $1$) and masters of all clusters are interconnected by a virtual unidirectional ring network (see Figure~\ref{fig:4.1}). During the resolution, a Boolean token circulates around the virtual ring from a master processor to another until the global convergence is achieved. So starting from the cluster with rank $1$, each master processor $i$ sets the token to {\it True} if the local convergence is achieved or to {\it False} otherwise, and sends it to master processor $i+1$. Finally, the global convergence is detected when the master of cluster $1$ receives from the master of cluster $L$ a token set to {\it True}. In this case, the master of cluster $1$ broadcasts a stop message to masters of other clusters. In this work, the local convergence on each cluster $l$ is detected when the following condition is satisfied
+The global convergence of the asynchronous multisplitting solver is detected
+when the clusters of processors have all converged locally. We implemented the
+global convergence detection process as follows. On each cluster a master
+processor is designated (for example the processor with rank 1) and masters of
+all clusters are interconnected by a virtual unidirectional ring network (see
+Figure~\ref{fig:4.1}). During the resolution, a Boolean token circulates around
+the virtual ring from a master processor to another until the global convergence
+is achieved. So starting from the cluster with rank 1, each master processor $i$
+sets the token to \textit{True} if the local convergence is achieved or to
+\text\it{False} otherwise, and sends it to master processor $i+1$. Finally, the
+global convergence is detected when the master of cluster 1 receives from the
+master of cluster $L$ a token set to \textit{True}. In this case, the master of
+cluster 1 broadcasts a stop message to masters of other clusters. In this work,
+the local convergence on each cluster $l$ is detected when the following
+condition is satisfied
 \begin{equation*}
   (k\leq \MI) \text{ or } (\|X_l^k - X_l^{k+1}\|_{\infty}\leq\epsilon)
 \end{equation*}
@@ -352,31 +366,33 @@ results.
 When the \emph{real} application runs in the simulation environment and produces the expected results, varying the input
 parameters and the program arguments allows us to compare outputs from the code execution. We have noticed from this
 study that the results depend on the following parameters:  
-\begin{itemize} 
-\item At the network level, we found that
-the most critical values are the bandwidth (bw) and the network latency (lat).  
-\item Hosts power (GFlops) can also
-influence on the results.  
-\item Finally, when submitting job batches for execution, the arguments values passed to the
-program like the maximum number of iterations or the \emph{external} precision are critical. They allow to ensure not
-only the convergence of the algorithm but also to get the main objective of the experimentation of the simulation in
-having an execution time in asynchronous less than in synchronous mode (i.e. speed-up less than $1$).
+\begin{itemize}
+\item At the network level, we found that the most critical values are the
+  bandwidth (bw) and the network latency (lat).
+\item Hosts power (GFlops) can also influence on the results.
+\item Finally, when submitting job batches for execution, the arguments values
+  passed to the program like the maximum number of iterations or the
+  \emph{external} precision are critical. They allow to ensure not only the
+  convergence of the algorithm but also to get the main objective of the
+  experimentation of the simulation in having an execution time in asynchronous
+  less than in synchronous mode (i.e. speed-up less than 1).
 \end{itemize}
 
-A priori, obtaining a speedup less than $1$ would be difficult in a local area
-network configuration where the synchronous mode will take advantage on the rapid
-exchange of information on such high-speed links. Thus, the methodology adopted
-was to launch the application on clustered network. In this last configuration,
-degrading the inter-cluster network performance will \emph{penalize} the synchronous
-mode allowing to get a speedup lower than $1$. This action simulates the case of
-clusters linked with long distance network like Internet.
+A priori, obtaining a speedup less than 1 would be difficult in a local area
+network configuration where the synchronous mode will take advantage on the
+rapid exchange of information on such high-speed links. Thus, the methodology
+adopted was to launch the application on clustered network. In this last
+configuration, degrading the inter-cluster network performance will
+\emph{penalize} the synchronous mode allowing to get a speedup lower than 1.
+This action simulates the case of clusters linked with long distance network
+like Internet.
 
 As a first step, the algorithm was run on a network consisting of two clusters
-containing $50$ hosts each, totaling $100$ hosts. Various combinations of
-the above factors have providing the results shown in
-Table~\ref{tab.cluster.2x50} with a matrix size ranging from $N_x = N_y = N_z =
-62 \text{ to } 171$ elements or from $62^{3} = \np{238328}$ to $171^{3} =
-\np{5211000}$ entries.
+containing 50 hosts each, totaling 100 hosts. Various combinations of the above
+factors have providing the results shown in Table~\ref{tab.cluster.2x50} with a
+matrix size ranging from $N_x = N_y = N_z = \text{62}$ to 171 elements or from
+$\text{62}^\text{3} = \text{\np{238328}}$ to $\text{171}^\text{3} =
+\text{\np{5211000}}$ entries.
 
 % use the same column width for the following three tables
 \newlength{\mytablew}\settowidth{\mytablew}{\footnotesize\np{E-11}}
@@ -388,7 +404,7 @@ Table~\ref{tab.cluster.2x50} with a matrix size ranging from $N_x = N_y = N_z =
 
 \begin{table}[!t]
   \centering
-  \caption{$2$ clusters, each with $50$ nodes}
+  \caption{2 clusters, each with 50 nodes}
   \label{tab.cluster.2x50}
 
   \begin{mytable}{6}
@@ -439,14 +455,14 @@ Table~\ref{tab.cluster.2x50} with a matrix size ranging from $N_x = N_y = N_z =
 \end{table}
   
 Then we have changed the network configuration using three clusters containing
-respectively $33$, $33$ and $34$ hosts, or again by on hundred hosts for all the
+respectively 33, 33 and 34 hosts, or again by on hundred hosts for all the
 clusters. In the same way as above, a judicious choice of key parameters has
 permitted to get the results in Table~\ref{tab.cluster.3x33} which shows the
-speedups less than $1$ with a matrix size from $62$ to $100$ elements.
+speedups less than 1 with a matrix size from 62 to 100 elements.
 
 \begin{table}[!t]
   \centering
-  \caption{$3$ clusters, each with $33$ nodes}
+  \caption{3 clusters, each with 33 nodes}
   \label{tab.cluster.3x33}
 
   \begin{mytable}{6}
@@ -535,21 +551,21 @@ bandwidth, a latency in order of a hundredth of a millisecond and a system power
 of one GFlops, an efficiency of about \np[\%]{40} in asynchronous mode is
 obtained for a matrix size of 62 elements. It is noticed that the result remains
 stable even if we vary the external precision from \np{E-5} to \np{E-9}. By
-increasing the problem size up to $100$ elements, it was necessary to increase the
+increasing the problem size up to 100 elements, it was necessary to increase the
 CPU power of \np[\%]{50} to \np[GFlops]{1.5} for a convergence of the algorithm
 with the same order of asynchronous mode efficiency.  Maintaining such a system
 power but this time, increasing network throughput inter cluster up to
 \np[Mbit/s]{50}, the result of efficiency of about \np[\%]{40} is obtained with
-high external precision of \np{E-11} for a matrix size from $110$ to $150$ side
+high external precision of \np{E-11} for a matrix size from 110 to 150 side
 elements.
 
-For the $3$ clusters architecture including a total of 100 hosts,
+For the 3 clusters architecture including a total of 100 hosts,
 Table~\ref{tab.cluster.3x33} shows that it was difficult to have a combination
 which gives an efficiency of asynchronous below \np[\%]{80}. Indeed, for a
-matrix size of $62$ elements, equality between the performance of the two modes
+matrix size of 62 elements, equality between the performance of the two modes
 (synchronous and asynchronous) is achieved with an inter cluster of
 \np[Mbit/s]{10} and a latency of \np[ms]{E-1}. To challenge an efficiency by
-\np[\%]{78} with a matrix size of $100$ points, it was necessary to degrade the
+\np[\%]{78} with a matrix size of 100 points, it was necessary to degrade the
 inter cluster network bandwidth from 5 to \np[Mbit/s]{2}.
 
 A last attempt was made for a configuration of three clusters but more powerful