Signed-off-by: Kunwu Chan <[email protected]>
---
defer/whichtochoose.tex | 14 +++++++-------
1 file changed, 7 insertions(+), 7 deletions(-)
diff --git a/defer/whichtochoose.tex b/defer/whichtochoose.tex
index 2b45ee5c..139c9636 100644
--- a/defer/whichtochoose.tex
+++ b/defer/whichtochoose.tex
@@ -114,7 +114,7 @@ which is why they are normally used on static data.
memory-allocation failure.
}\QuickQuizEnd
-The ``Duration of Protection'' describes constraints (if any) on how
+The ``Duration of Protection'' row describes constraints (if any) on how
long a period of time a user may protect a given object.
Reference counting and hazard pointers can both protect objects for
extended time periods with no untoward side effects, but
@@ -132,9 +132,9 @@ whether the reference acquisition can fail, resulting in a
retry
operation, which is the case for reference counting, hazard pointers,
and sequence locks.
In the case of reference counting and hazard pointers, retries are only
-required if an attempt to acquire a reference to a given object while
-that object is in the process of being deleted, a topic covered in more
-detail in the next section.
+required if an attempt to acquire a reference to a given object fails
+while that object is in the process of being deleted, a topic covered in
+more detail in the next section.
Sequence locking must of course retry its critical section should it
run concurrently with any update.
@@ -150,7 +150,7 @@ run concurrently with any update.
one traversal to another''.
}\QuickQuizEnd
-The ``Reclamation Timing'' gives the minimum delay from the time that
+The ``Reclamation Timing'' row gives the minimum delay from the time that
the last reader finishes with a removed object to the time that this
removed object may be freed.
Reference counting is the only technique capable of freeing immediately
@@ -290,7 +290,7 @@ But those wishing more detail should continue on to the
next section.
provides more-detailed rules of thumb that can help you choose among the
four deferred-processing techniques presented in this chapter.
-As shown in the ``Existence Guarantee'' row,
+As shown in the ``Existence Guarantees'' row,
if you need \IXpl{existence guarantee} for linked
data elements, you must use reference counting, hazard pointers, or RCU\@.
Sequence locks do not provide existence guarantees, instead providing
@@ -566,7 +566,7 @@ a mechanism resembling sequence locking.
\subsubsection{Production Uses of RCU}
\label{sec:defer:Production Uses of RCU}
-IBM's VM/XA is adopted passive serialization, a mechanism similar to
+IBM's VM/XA adopted passive serialization, a mechanism similar to
RCU, some time in the 1980s~\cite{Hennessy89}.
DYNIX/ptx adopted RCU in 1993~\cite{McKenney98,Slingwine95}.
--
2.25.1
