From 7cad530ea8d8c827c171058e8134fe5160e48846 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Thu, 4 Nov 2010 17:32:18 +0000 Subject: [PATCH] Add a sentence. git-svn-id: https://svn.dealii.org/trunk@22608 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/examples/step-40/doc/results.dox | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/deal.II/examples/step-40/doc/results.dox b/deal.II/examples/step-40/doc/results.dox index d9608411c7..1f6ec4ad75 100644 --- a/deal.II/examples/step-40/doc/results.dox +++ b/deal.II/examples/step-40/doc/results.dox @@ -27,7 +27,10 @@ to write a program that scales to many more machines. For example, here are two graphs that show how the run time of a large number of parts of the program scales on problems with around 52 and 375 million degrees of freedom if we take more and more processors (these and the next couple of -graphs are taken from the @ref distributed_paper "Distributed Computing paper"): +graphs are taken from an earlier version of the +@ref distributed_paper "Distributed Computing paper"; updated graphs showing +data of runs on even larger numbers of processors, and a lot +more interpretation can be found in the final version of the paper): -- 2.39.5