X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/blobdiff_plain/43651bc69ac69595ccd000528fd530f485ffd7fe..fce6f1ee7a792cf332bb87dc9c6f520086a8461c:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index de34cb6..bf90391 100644
--- a/paper.tex
+++ b/paper.tex
@@ -244,60 +244,109 @@ magnitude. To our knowledge, there is no study on this problematic.
 
 \section{SimGrid}
 \label{sec:simgrid}
-SimGrid~\cite{SimGrid,casanova+legrand+quinson.2008.simgrid,casanova+giersch+legrand+al.2014.versatile} is a discrete event simulation framework to study the behavior of large-scale distributed computing platforms as Grids, Peer-to-Peer systems, Clouds and High Performance Computation systems. It is widely used to simulate and evaluate heuristics, prototype applications or even assess legacy MPI applications. It is still actively developed by the scientific community and distributed as an open source software.
 
-%%%%%%%%%%%%%%%%%%%%%%%%%
-% SimGrid~\cite{SimGrid,casanova+legrand+quinson.2008.simgrid,casanova+giersch+legrand+al.2014.versatile}
-% is a simulation framework to study the behavior of large-scale distributed
-% systems.  As its name suggests, it emanates from the grid computing community,
-% but is nowadays used to study grids, clouds, HPC or peer-to-peer systems.  The
-% early versions of SimGrid date back from 1999, but it is still actively
-% developed and distributed as an open source software.  Today, it is one of the
-% major generic tools in the field of simulation for large-scale distributed
-% systems.
-
-SimGrid provides several programming interfaces: MSG to simulate Concurrent
-Sequential Processes, SimDAG to simulate DAGs of (parallel) tasks, and SMPI to
-run real applications written in MPI~\cite{MPI}.  Apart from the native C
-interface, SimGrid provides bindings for the C++, Java, Lua and Ruby programming
-languages.  SMPI is the interface that has been used for the work described in
-this paper.  The SMPI interface implements about \np[\%]{80} of the MPI 2.0
-standard~\cite{bedaride+degomme+genaud+al.2013.toward}, and supports
-applications written in C or Fortran, with little or no modifications (cf Section IV - paragraph B).
-
-Within SimGrid, the execution of a distributed application is simulated by a
-single process.  The application code is really executed, but some operations,
-like communications, are intercepted, and their running time is computed
-according to the characteristics of the simulated execution platform.  The
-description of this target platform is given as an input for the execution, by
-means of an XML file.  It describes the properties of the platform, such as
-the computing nodes with their computing power, the interconnection links with
-their bandwidth and latency, and the routing strategy.  The scheduling of the
-simulated processes, as well as the simulated running time of the application
-are computed according to these properties.
-
-To compute the durations of the operations in the simulated world, and to take
-into account resource sharing (e.g. bandwidth sharing between competing
-communications), SimGrid uses a fluid model.  This allows users to run relatively fast
-simulations, while still keeping accurate
-results~\cite{bedaride+degomme+genaud+al.2013.toward,
-  velho+schnorr+casanova+al.2013.validity}.  Moreover, depending on the
-simulated application, SimGrid/SMPI allows to skip long lasting computations and
-to only take their duration into account.  When the real computations cannot be
-skipped, but the results are unimportant for the simulation results, it is
-also possible to share dynamically allocated data structures between
-several simulated processes, and thus to reduce the whole memory consumption.
-These two techniques can help to run simulations on a very large scale.
-
-The validity of simulations with SimGrid has been asserted by several studies.
-See, for example, \cite{velho+schnorr+casanova+al.2013.validity} and articles
-referenced therein for the validity of the network models.  Comparisons between
-real execution of MPI applications on the one hand, and their simulation with
-SMPI on the other hand, are presented in~\cite{guermouche+renard.2010.first,
-  clauss+stillwell+genaud+al.2011.single,
-  bedaride+degomme+genaud+al.2013.toward}.  All these works conclude that
-SimGrid is able to simulate pretty accurately the real behavior of the
-applications.
+In the scope of this paper, the Simgrid
+toolkitSimGrid~\cite{SimGrid,casanova+legrand+quinson.2008.simgrid,casanova+giersch+legrand+al.2014.versatile},
+an open source framework actively developped by its community, has been choosen
+to simulate the behavior of the solvers algorithms in different grid
+computational configurations. Simgrid pretends to be non-specialized in opposite
+to some other simulators which stayed to be very specific oriented-application.
+One of the well-known Simgrid advantage is its SMPI (Simulated MPI). SMPI
+purpose is to execute by simulation in a similar way as in real life, an MPI
+distributed application and to get accurate results with the detailed resources
+consumption. Several studies have demonstrated the accuracy of the simulation
+compared with execution on real physical architectures. In addition of SMPI,
+Simgrid provides other API which can be convienent for different distrbuted
+applications: computational grid applications, High Performance Computing (HPC),
+P2P but also clouds applications. In this paper we use the SMPI API. It
+implements about \np[\%]{80} of the MPI 2.0 standard and allows minor
+modifications of the initial code~\cite{bedaride+degomme+genaud+al.2013.toward}
+(see Section~\ref{sec:04.02}).
+
+
+ Provided as an input to the simulator, at least $3$ XML files describe the
+ computational grid resources: number of clusters in the grid, number of
+ processors/cores in each cluster, detailed description of the intra and inter
+ networks and the list of the hosts in each cluster (see the details in Section~\ref{sec:expe}). Simgrid uses a fluid model to simulate the program execution.
+ This gives several simulation modes which produce accurate
+ results~\cite{bedaride+degomme+genaud+al.2013.toward,
+ velho+schnorr+casanova+al.2013.validity}. For instance, the "in vivo" mode
+ really executes the computation but "intercepts" the communications (running
+ time is then evaluated according to the parameters of the simulated platform).
+ It is also possible for SimGrid/SMPI to only keep duration of large
+ computations by skipping them. Moreover the application can be run "in vitro"
+ by sharing some in-memory structures between the simulated processes and
+ thus allowing the use of very large data scale.
+
+
+The choice of Simgrid/SMPI as a simulator tool in this study has been emphasized
+by the results obtained by several studies to validate, in real environments,
+the behavior of different network models simulated in
+Simgrid~\cite{velho+schnorr+casanova+al.2013.validity}. Other studies underline
+the comparison between real MPI executions  and SimGrid/SMPI
+ones\cite{guermouche+renard.2010.first, clauss+stillwell+genaud+al.2011.single,
+bedaride+degomme+genaud+al.2013.toward}. These works show the accuracy of
+SimGrid simulations.
+
+
+
+
+
+
+% SimGrid~\cite{SimGrid,casanova+legrand+quinson.2008.simgrid,casanova+giersch+legrand+al.2014.versatile} is a discrete event simulation framework to study the behavior of large-scale distributed computing platforms as Grids, Peer-to-Peer systems, Clouds and High Performance Computation systems. It is widely used to simulate and evaluate heuristics, prototype applications or even assess legacy MPI applications. It is still actively developed by the scientific community and distributed as an open source software.
+%
+% %%%%%%%%%%%%%%%%%%%%%%%%%
+% % SimGrid~\cite{SimGrid,casanova+legrand+quinson.2008.simgrid,casanova+giersch+legrand+al.2014.versatile}
+% % is a simulation framework to study the behavior of large-scale distributed
+% % systems.  As its name suggests, it emanates from the grid computing community,
+% % but is nowadays used to study grids, clouds, HPC or peer-to-peer systems.  The
+% % early versions of SimGrid date back from 1999, but it is still actively
+% % developed and distributed as an open source software.  Today, it is one of the
+% % major generic tools in the field of simulation for large-scale distributed
+% % systems.
+%
+% SimGrid provides several programming interfaces: MSG to simulate Concurrent
+% Sequential Processes, SimDAG to simulate DAGs of (parallel) tasks, and SMPI to
+% run real applications written in MPI~\cite{MPI}.  Apart from the native C
+% interface, SimGrid provides bindings for the C++, Java, Lua and Ruby programming
+% languages.  SMPI is the interface that has been used for the work described in
+% this paper.  The SMPI interface implements about \np[\%]{80} of the MPI 2.0
+% standard~\cite{bedaride+degomme+genaud+al.2013.toward}, and supports
+% applications written in C or Fortran, with little or no modifications (cf Section IV - paragraph B).
+%
+% Within SimGrid, the execution of a distributed application is simulated by a
+% single process.  The application code is really executed, but some operations,
+% like communications, are intercepted, and their running time is computed
+% according to the characteristics of the simulated execution platform.  The
+% description of this target platform is given as an input for the execution, by
+% means of an XML file.  It describes the properties of the platform, such as
+% the computing nodes with their computing power, the interconnection links with
+% their bandwidth and latency, and the routing strategy.  The scheduling of the
+% simulated processes, as well as the simulated running time of the application
+% are computed according to these properties.
+%
+% To compute the durations of the operations in the simulated world, and to take
+% into account resource sharing (e.g. bandwidth sharing between competing
+% communications), SimGrid uses a fluid model.  This allows users to run relatively fast
+% simulations, while still keeping accurate
+% results~\cite{bedaride+degomme+genaud+al.2013.toward,
+%   velho+schnorr+casanova+al.2013.validity}.  Moreover, depending on the
+% simulated application, SimGrid/SMPI allows to skip long lasting computations and
+% to only take their duration into account.  When the real computations cannot be
+% skipped, but the results are unimportant for the simulation results, it is
+% also possible to share dynamically allocated data structures between
+% several simulated processes, and thus to reduce the whole memory consumption.
+% These two techniques can help to run simulations on a very large scale.
+%
+% The validity of simulations with SimGrid has been asserted by several studies.
+% See, for example, \cite{velho+schnorr+casanova+al.2013.validity} and articles
+% referenced therein for the validity of the network models.  Comparisons between
+% real execution of MPI applications on the one hand, and their simulation with
+% SMPI on the other hand, are presented in~\cite{guermouche+renard.2010.first,
+%   clauss+stillwell+genaud+al.2011.single,
+%   bedaride+degomme+genaud+al.2013.toward}.  All these works conclude that
+% SimGrid is able to simulate pretty accurately the real behavior of the
+% applications.
 %%%%%%%%%%%%%%%%%%%%%%%%%
 
 \section{Two-stage multisplitting methods}
@@ -614,8 +663,8 @@ efficient for distributed systems with high latency networks.
 \centering
 \includegraphics[width=100mm]{cluster_x_nodes_n1_x_n2.pdf}
 \caption{Various grid configurations with two networks parameters: $N1$ vs. $N2$}
-\LZK{CE, remplacer les ``,'' des décimales par un ``.''}
-\RCE{ok}
+%\LZK{CE, remplacer les ``,'' des décimales par un ``.''}
+%\RCE{ok}
 \label{fig:02}
 \end{figure}
 
@@ -711,17 +760,16 @@ theoretically reduce  the overall execution  time and can improve  the algorithm
 performance.
 
 In this section,  the SimGrid simulator is  used to compare the  behavior of the
-two-stage algorithm in  asynchronous mode  with GMRES  in synchronous  mode.  Several
-benchmarks have  been performed with  various combinations of the  grid resources
-(CPU, Network, matrix size, \ldots). The test  conditions are summarized
-in  Table~\ref{tab:02}. In  order to  compare  the execution  times. Table~\ref{tab:03}
-reports the  relative gains between both  algorithms. It is defined  by the ratio
-between  the   execution  time  of   GMRES  and   the  execution  time   of  the
-multisplitting.
-\LZK{Quelle table repporte les gains relatifs?? Sûrement pas Table II !!}
-\RCE{Table III avec la nouvelle numerotation}
-The  ratio  is  greater  than  one  because  the  asynchronous
-multisplitting version is faster than GMRES.
+two-stage  algorithm  in  asynchronous  mode with  GMRES  in  synchronous  mode.
+Several benchmarks  have been  performed with various  combinations of  the grid
+resources  (CPU,  Network,  matrix  size,   \ldots).  The  test  conditions  are
+summarized in Table~\ref{tab:02}.
+
+
+
+%\LZK{Quelle table repporte les gains relatifs?? Sûrement pas Table II !!}
+%\RCE{Table III avec la nouvelle numerotation}
+
 
 \begin{table}[htbp]
 \centering
@@ -779,15 +827,15 @@ multisplitting version is faster than GMRES.
  \label{tab:03}
 \end{table}
 
-Again,  comprehensive and  extensive tests  have been  conducted with  different
-parameters as  the CPU power, the  network parameters (bandwidth and  latency)
-and with different problem size. The  relative gains greater than $1$  between the
-two algorithms have  been captured after  each step  of the test.   In
-Table~\ref{tab:08}  are  reported the  best  grid  configurations allowing
-the  two-stage multisplitting algorithm to  be more than  $2.5$ times faster  than the
-classical  GMRES.  These  experiments also  show the  relative tolerance  of the
-multisplitting algorithm when using a low speed network as usually observed with
-geographically distant clusters through the internet.
+
+Table~\ref{tab:03} reports  the relative gains  between both algorithms.   It is
+defined by the ratio between the execution  time of GMRES and the execution time
+of the  multisplitting. The ratio is  greater than one because  the asynchronous
+multisplitting  version  is  faster  than   GMRES.  In  average,  the  two-stage
+multisplitting algorithm to  be more than $2.5$ times faster  than the classical
+GMRES.  These experiments also show the relative tolerance of the multisplitting
+algorithm when using a low speed network as usually observed with geographically
+distant clusters through the internet.
 
 
 \section{Conclusion}