From a299d76a89cc46941151da44ece27736ee1a5497 Mon Sep 17 00:00:00 2001 From: wolf Date: Tue, 6 Apr 2004 16:46:47 +0000 Subject: [PATCH] Add a paragraph. git-svn-id: https://svn.dealii.org/trunk@8981 0785d39b-7218-0410-832d-ea1e28bc413d --- .../chapter-2.step-by-step/step-17.data/intro.html | 13 +++++++++++++ 1 file changed, 13 insertions(+) diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/step-17.data/intro.html b/deal.II/doc/tutorial/chapter-2.step-by-step/step-17.data/intro.html index 5a921a0a88..f524fcc3e0 100644 --- a/deal.II/doc/tutorial/chapter-2.step-by-step/step-17.data/intro.html +++ b/deal.II/doc/tutorial/chapter-2.step-by-step/step-17.data/intro.html @@ -51,6 +51,19 @@ time, PETSc provides dummy MPI stubs that allow to run the same program on a single machine if so desired, without any changes.

+

+Note, however, that the only data structures we parallelize are matrices and +vectors. We do, in particular, not split up the Triangulation and +DoFHandler classes: each process still has a complete copy of +these objects, and all processes have exact copies of what the other processes +have. Parallelizing the data structures used in hierarchic and unstructured +triangulations is a very hard problem, and we do not attempt to do so at +present. It also requires that many more aspects of the application program +have to be changed, since for example loops over all cells can only include +locally available cells. We thus went for the path of least resistance and +only parallelized the linear algebra part. +

+

The techniques this program demonstrates are: how to use the PETSc wrapper classes; how to parallelize operations for jobs running on an MPI network; and -- 2.39.5