On Sat, Jun 01, 2019 at 09:54:24AM +0900, SeongJae Park wrote:
> Signed-off-by: SeongJae Park <sj38.park@xxxxxxxxx>
Good eyes, applied and pushed, thank you!
Thanx, Paul
> ---
> defer/hazptr.tex | 2 +-
> 1 file changed, 1 insertion(+), 1 deletion(-)
>
> diff --git a/defer/hazptr.tex b/defer/hazptr.tex
> index b491c59..be93342 100644
> --- a/defer/hazptr.tex
> +++ b/defer/hazptr.tex
> @@ -332,7 +332,7 @@ object traversed.
> Therefore, hazard pointers's performance is far short of ideal.
> On the other hand, unlike naive approaches to concurrent reference-counting,
> hazard pointers do operate correctly for workloads
> -involving concurrent updatesa.
> +involving concurrent updates.
> Additional performance comparisons with other mechanisms may be found in
> Chapter~\ref{chp:Data Structures}
> and in other publications~\cite{ThomasEHart2007a,McKenney:2013:SDS:2483852.2483867,MagedMichael04a}.
> --
> 2.10.0
>
