Signed-off-by: Akira Yokosawa <akiyks@xxxxxxxxx>
---
together/applyrcu.tex | 6 +++---
together/count.tex | 10 +++++-----
together/refcnt.tex | 2 +-
3 files changed, 9 insertions(+), 9 deletions(-)
diff --git a/together/applyrcu.tex b/together/applyrcu.tex
index 1f157a21..975a10a6 100644
--- a/together/applyrcu.tex
+++ b/together/applyrcu.tex
@@ -394,9 +394,9 @@ data element shown in
The \co{meas_1}, \co{meas_2}, and \co{meas_3} fields are a set
of correlated measurements that are updated periodically.
It is critically important that readers see these three values from
-a single measurement update: If a reader sees an old value of
-\co{meas_1} but new values of \co{meas_2} and \co{meas_3}, that
-reader will become fatally confused.
+a single measurement update:
+If a reader sees an old value of \co{meas_1} but new values of
+\co{meas_2} and \co{meas_3}, that reader will become fatally confused.
How can we guarantee that readers will see coordinated sets of these
three values?\footnote{
This situation is similar to that described in
diff --git a/together/count.tex b/together/count.tex
index 882e975c..2650f5ba 100644
--- a/together/count.tex
+++ b/together/count.tex
@@ -46,16 +46,16 @@ which would be a severe bottleneck on large systems.
Another approach is to ``just say no'' to counting, following the example
of the \co{noatime} mount option.
-If this approach is feasible, it is clearly the best: After all, nothing
-is faster than doing nothing.
+If this approach is feasible, it is clearly the best:
+After all, nothing is faster than doing nothing.
If the lookup count cannot be dispensed with, read on!
Any of the counters from \cref{chp:Counting}
could be pressed into service, with the statistical counters described in
\cref{sec:count:Statistical Counters} being perhaps the most common choice.
-However, this results in a large memory footprint: The number of counters
-required is the number of data elements multiplied by the number of
-threads.
+However, this results in a large memory footprint:
+The number of counters required is the number of data elements multiplied
+by the number of threads.
If this memory overhead is excessive, then one approach is to keep
per-core or even per-socket counters rather than per-CPU counters,
diff --git a/together/refcnt.tex b/together/refcnt.tex
index 5cdde7cc..b30acf5b 100644
--- a/together/refcnt.tex
+++ b/together/refcnt.tex
@@ -139,7 +139,7 @@ contain memory barriers, and all checked acquisition operations also
contain memory barriers.
Therefore, cases ``CA'' and ``MCA'' are equivalent to ``CAM'', so that
there are sections below for only the first four cases and the sixth case:
-``$-$'', ``A'', ``AM'', ``CAM'', and ``M''.
+``$-$'', ``A'', ``AM'', ``CAM'', and ``M\@''.
Later sections describe optimizations that can improve performance
if reference acquisition and release is very frequent, and the
reference count need be checked for zero only very rarely.
--
2.17.1
