Fix typo.

git-svn-id: https://svn.dealii.org/trunk@2407 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/doc/reports/multithreading/multithreading.tex b/deal.II/doc/reports/multithreading/multithreading.tex
index 74d5f96950ce799191f4bc7234fb2f1ba217d3a6..c3b962a0c85559786ab96870fec86da85ea56ebb 100644 (file)
--- a/deal.II/doc/reports/multithreading/multithreading.tex
+++ b/deal.II/doc/reports/multithreading/multithreading.tex
@@ -86,7 +86,7 @@ global memory at equal cost.
 Due to this uniform memory access (UMA) architecture, communication can be
 performed in the global memory and is no more costly than access to any other
 memory location. Thus, there is also no more need to change the mathematical
-formulation to reduce communication, and programs using this architecture llok
+formulation to reduce communication, and programs using this architecture look
 very much like programs written for single processor machines. The purpose of
 this report is to explain the techniques used in \texttt{deal.II} by which we
 try to program these computers.