Address comments in the second round of reviews.

diff --git a/examples/step-17/doc/intro.dox b/examples/step-17/doc/intro.dox
index 8a0d51c52fc28e6959918322ca2e224848cf2333..6e0156bde253b3ba9a46030ef9e306062a9e25ab 100644 (file)
--- a/examples/step-17/doc/intro.dox
+++ b/examples/step-17/doc/intro.dox
@@ -98,7 +98,7 @@ we will show how to do this in step-40 and some other programs. There are
 numerous occasions where, in the course of discussing how a function of this
 program works, we will comment on the fact that it will not scale to large
 problems and why not. All of these issues will be addressed in step-18 and
-in particular step-40, which scales to very large number of processes.
+in particular step-40, which scales to very large numbers of processes.
 
 Philosophically, the way MPI operates is as follows. You typically run a
 program via

diff --git a/examples/step-17/doc/results.dox b/examples/step-17/doc/results.dox
index b08b160e54d9ed5f267b2121458e34e438137f44..4da8e77bd82c23992ddc246e1563b1bfbb759ecd 100644 (file)
--- a/examples/step-17/doc/results.dox
+++ b/examples/step-17/doc/results.dox
@@ -9,7 +9,7 @@ most basic way to run MPI programs is using a command line like
 @code
   mpirun -np 32 ./step-17
 @endcode
-to run the step-17 executable with 32 processors. 
+to run the step-17 executable with 32 processors.
 
 (If you work on a cluster, then there is typically a step in between where you
 need to set up a job script and submit the script to a scheduler. The scheduler

diff --git a/examples/step-17/step-17.cc b/examples/step-17/step-17.cc
index 0c80ccc2ebf7a3e5fd22480301ef5a6659320bc4..4bc646b6d31a23e8801e11a413abfb55bed05c6a 100644 (file)
--- a/examples/step-17/step-17.cc
+++ b/examples/step-17/step-17.cc
@@ -124,7 +124,7 @@ namespace Step17
 
     // Then we have two variables that tell us where in the parallel
     // world we are. The first of the following variables,
-    // <code>n_mpi_processes</code> tells us how many MPI processes
+    // <code>n_mpi_processes</code>, tells us how many MPI processes
     // there exist in total, while the second one,
     // <code>this_mpi_process</code>, indicates which is the number of
     // the present process within this space of processes (in MPI
@@ -304,7 +304,7 @@ namespace Step17
   // GridTools::partition_triangulation() function that does this at a
   // much higher level of programming.
   //
-  // @note As mentioned in the introduction, we can avoid this manual
+  // @note As mentioned in the introduction, we could avoid this manual
   //   partitioning step if we used the parallel::shared::Triangulation
   //   class for the triangulation object instead (as we do in step-18).
   //   That class does, in essence, everything a regular triangulation
@@ -327,7 +327,7 @@ namespace Step17
   // The final step of this initial setup is that we get ourselves a
   // variable that indicates how many degrees of freedom the current
   // process is responsible for. (Note that a degree of freedom is not
-  // necessarily owned by the process that owns a cells just because
+  // necessarily owned by the process that owns a cell just because
   // the degree of freedom lives on this cell: some degrees of freedom
   // live on interfaces between subdomains, and are consequently only owned by
   // one of the processes adjacent to this interface.)