new curve

[prng_gpu.git] / prng_gpu.tex

diff --git a/prng_gpu.tex b/prng_gpu.tex
index bc5b3e55f5d7896f4374abcec6c8f56b0b4f3ee8..c48aeda1cc9aa4636e434c7410060fbc3c39f26b 100644 (file)
--- a/prng_gpu.tex
+++ b/prng_gpu.tex
@@ -895,7 +895,7 @@ which represent the indexes of the  other threads for which the results are used
 by the  current thread. In  the algorithm, we  consider that a  64-bits xor-like
 PRNG is used, that is why both 32-bits parts are used.
 
 by the  current thread. In  the algorithm, we  consider that a  64-bits xor-like
 PRNG is used, that is why both 32-bits parts are used.
 

-This version also succeed to the BigCrush batteries of tests.
+This version also succeeds to the {\it BigCrush} batteries of tests.

 
 \begin{algorithm}
 
 
 \begin{algorithm}
 


@@ -978,11 +978,10 @@ generated per second is almost constant.   With the naive version, it is between
 \end{figure}
 
 
 \end{figure}
 
 

-First of all we have compared the time to generate X random numbers with both
-the CPU version and the GPU version. 
+In  comparison,   Listing~\ref{algo:seqCIprng}  allows  us   to  generate  about
+138MSample/s with only one core of the Xeon E5530.
+

 
 

-Faire une courbe du nombre de random en fonction du nombre de threads,
-éventuellement en fonction du nombres de threads par bloc.