modif

[book_gpu.git] / BookGPU / Chapters / chapter6 / ch6.tex

diff --git a/BookGPU/Chapters/chapter6/ch6.tex b/BookGPU/Chapters/chapter6/ch6.tex
index 79cd4290d33b8b157fd6199310bff4d64431c772..65698d76c92a89410d74b1339e6920bdf0c1efe1 100755 (executable)
--- a/BookGPU/Chapters/chapter6/ch6.tex
+++ b/BookGPU/Chapters/chapter6/ch6.tex
@@ -9,18 +9,20 @@
 \newcommand{\Equ}[1]{(\ref{#1})}
 \def\Reals{\mathbb{R}}
 
 \newcommand{\Equ}[1]{(\ref{#1})}
 \def\Reals{\mathbb{R}}
 

-\definecolor{shadecolor}{rgb}{0.95,0.95,0.95}
-\newenvironment{Algo}{\vspace{-1em}\begin{center}\begin{minipage}[h]{0.95\columnwidth}\begin{shaded}\begin{tabbing}%
-  \hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\= \kill} %
- { \end{tabbing}\vspace{-1em}\end{shaded}\end{minipage}\end{center}\vspace{-1em}}
+%\newenvironment{Algo}{\vspace{-1em}\begin{center}\begin{minipage}[h]{0.95\columnwidth}\begin{shaded}\begin{tabbing}%
+%  \hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\=\hspace{3mm}\= \kill} %
+% { \end{tabbing}\vspace{-1em}\end{shaded}\end{minipage}\end{center}\vspace{-1em}}

 
 

-\lstnewenvironment{Listing}[2]{\lstset{basicstyle=\scriptsize\ttfamily,%
-    breaklines=true, breakatwhitespace=true, language=C, keywordstyle=\color{black},%
-    prebreak = \raisebox{0ex}[0ex][0ex]{\ensuremath{\hookleftarrow}},%
-    commentstyle=\textit, numbersep=1em, numberstyle=\tiny, numbers=left,%
-    numberblanklines=false, mathescape, escapechar=@, label=#1, caption={#2}}}{}
+\lstnewenvironment{Listing}[2]{\lstset{
+%% basicstyle=\scriptsize\ttfamily,%
+%%      breaklines=true, breakatwhitespace=true, language=C, keywordstyle=\color{black},%
+%%      prebreak = \raisebox{0ex}[0ex][0ex]{\ensuremath{\hookleftarrow}},%
+%%      commentstyle=\textit, numbersep=1em, numberstyle=\tiny, numbers=left,%
+%%      numberblanklines=false, mathescape, escapechar=@,
+ escapechar=@, label=#1, caption={#2}}
+}{}

 
 

-\def\N{$\mathbb N$ }
+%\def\N{$\mathbb N$ }

 \def\R{$\mathbb R$ }
 \def\Z{$\mathbb Z$ }
 \def\Q{$\mathbb Q$ }
 \def\R{$\mathbb R$ }
 \def\Z{$\mathbb Z$ }
 \def\Q{$\mathbb Q$ }


@@ -32,7 +34,7 @@
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapterauthor{Sylvain Contassot-Vivier}{Université Lorraine, Loria UMR 7503 \& AlGorille INRIA Project Team, Nancy, France.}
 \chapterauthor{Stephane Vialle}{SUPELEC, UMI GT-CNRS 2958 \& AlGorille INRIA Project Team, Metz, France.}
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \chapterauthor{Sylvain Contassot-Vivier}{Université Lorraine, Loria UMR 7503 \& AlGorille INRIA Project Team, Nancy, France.}
 \chapterauthor{Stephane Vialle}{SUPELEC, UMI GT-CNRS 2958 \& AlGorille INRIA Project Team, Metz, France.}

-\chapterauthor{Jens Gustedt}{INRIA Nancy -- Grand Est, AlGorille INRIA Project Team, Strasbourg, France.}
+\chapterauthor{Jens Gustedt}{INRIA Nancy--Grand Est, AlGorille INRIA Project Team, Strasbourg, France.}

 
 \chapter{Development methodologies for GPU and cluster of GPUs}
 
 
 \chapter{Development methodologies for GPU and cluster of GPUs}
 


@@ -54,23 +56,23 @@
 % Glossaire
 \section{Glossary}
 \begin{Glossary}
 % Glossaire
 \section{Glossary}
 \begin{Glossary}

-\item[AIAC] Asynchronous Iterations - Asynchronous Communications.
-\item[Asynchronous iterations] Iterative process where each element is updated
+\item[AIAC] Asynchronous Iterations and Asynchronous Communications.
+\item[Asynchronous iterations] iterative process where each element is updated

   without waiting for the last updates of the other elements.
   without waiting for the last updates of the other elements.

-\item[Auxiliary computations] Optional computations performed in parallel to the
+\item[Auxiliary computations] optional computations performed in parallel to the

   main computations and used to complete them or speed them up.
   main computations and used to complete them or speed them up.

-\item[BSP parallel scheme] Bulk Synchronous Parallel, a parallel model that uses
-  a repeated pattern (superstep) composed of: computation, communication, barrier.
-\item[GPU stream] Serialized data transfers and computations performed on a same
+\item[BSP parallel scheme] bulk Synchronous Parallel, a parallel model that uses
+  a repeated pattern (superstep) composed of computation, communication, barrier.
+\item[GPU stream] serialized data transfers and computations performed on a same

   piece of data.
   piece of data.

-\item[Message loss/miss] Can be said about a message that is either not
+\item[Message loss/miss] can be said about a message that is either not

   sent or sent but not received (possible with unreliable communication protocols).
   sent or sent but not received (possible with unreliable communication protocols).

-\item[Message stamping] Inclusion of a specific value in messages of the same tag to
+\item[Message stamping] inclusion of a specific value in messages of the same tag to

   distinguish them (kind of secondary tag).
   distinguish them (kind of secondary tag).

-\item[ORWL] Ordered Read Write Locks, a programming tool proposing a unified
+\item[ORWL] Ordered Read-Write Locks, a programming tool proposing a unified

   programming model.
   programming model.

-\item[Page-locked data] Data that are locked in cache memory to ensure fast accesses.
-\item[Residual] Difference between results of consecutive iterations in an
+\item[Page-locked data] data that are locked in cache memory to ensure fast accesses.
+\item[Residual] difference between results of consecutive iterations in an

   iterative process.
 \item[Streamed GPU sequence] GPU transfers and computations performed
   simultaneously via distinct GPU streams.
   iterative process.
 \item[Streamed GPU sequence] GPU transfers and computations performed
   simultaneously via distinct GPU streams.