correct d'une ref

[kahina_paper2.git] / paper.tex

diff --git a/paper.tex b/paper.tex
index 0be1e0855b00e68f64f08e9996547fbbd20c4152..e932a3c48d1e0b38bb43f0dcfb8cdca6eeab81e5 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -88,7 +88,7 @@ which each processor continues to update its approximations even
 though the latest values of other approximations $z^{k}_{i}$ have not
 been received from the other processors, in contrast with synchronous
 algorithms where it would wait those values before making a new
 though the latest values of other approximations $z^{k}_{i}$ have not
 been received from the other processors, in contrast with synchronous
 algorithms where it would wait those values before making a new

-iteration. Couturier and al.~\cite{Raphaelall01} proposed two methods
+iteration. Couturier and al.~\cite{cs01:nj} proposed two methods

 of parallelization for a shared memory architecture with OpenMP and
 for a distributed memory one with MPI. They are able to compute the
 roots of sparse polynomials of degree 10,000. The authors showed an interesting
 of parallelization for a shared memory architecture with OpenMP and
 for a distributed memory one with MPI. They are able to compute the
 roots of sparse polynomials of degree 10,000. The authors showed an interesting