Signed-off-by: Akira Yokosawa <akiyks@xxxxxxxxx>
---
defer/whichtochoose.tex | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/defer/whichtochoose.tex b/defer/whichtochoose.tex
index 95b355a1c471..489299a7ae02 100644
--- a/defer/whichtochoose.tex
+++ b/defer/whichtochoose.tex
@@ -83,7 +83,7 @@ techniques from one another.
The ``Readers'' row summarizes the results presented in
\cref{fig:defer:Pre-BSD Routing Table Protected by RCU QSBR},
which shows that all but \IXalt{reference counting}{reference count}
-are enjoy reasonably fast and scalable readers.
+enjoy reasonably fast and scalable readers.
The ``Number of Protected Objects'' row evaluates each technique's need
for external storage with which to record reader protection.
@@ -336,7 +336,7 @@ has a \IXalth{bounded wait-free}{bounded}{wait free}
it can carry out a finite traversal by executing a bounded number of
instructions.
-The ``Reader Reference Acquisition'' rows indicates that only RCU is
+The ``Reader Reference Acquisition'' row indicates that only RCU is
capable of unconditionally acquiring references.
The entry for sequence locks is ``Unsafe'' because, again, sequence locks
detect updates rather than acquiring references.
--
2.25.1
