summaryrefslogtreecommitdiffstats
path: root/chapters/sigmod23/exp-extensions.tex
diff options
context:
space:
mode:
Diffstat (limited to 'chapters/sigmod23/exp-extensions.tex')
-rw-r--r--chapters/sigmod23/exp-extensions.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/chapters/sigmod23/exp-extensions.tex b/chapters/sigmod23/exp-extensions.tex
index 62f15f4..3d3f5b7 100644
--- a/chapters/sigmod23/exp-extensions.tex
+++ b/chapters/sigmod23/exp-extensions.tex
@@ -49,9 +49,9 @@ as additional insertion threads are added. Both plots show linear scaling
up to 3 or 4 threads, before the throughput levels off. Further, even
with as many as 32 threads, the system is able to maintain a stable
insertion throughput. Note that this implementation of concurrency
-is incredibly rudamentary, and doesn't take advantage of concurrent
+is incredibly rudimentary, and doesn't take advantage of concurrent
merging opportunities, among other things. An implementation with
support for this will be discussed in Chapter~\ref{chap:tail-latency},
-and shown to perform significantly better. Even with this rudamentary
+and shown to perform significantly better. Even with this rudimentary
implementation of concurrency, however, \texttt{DE-IRS} is able to
outperform \texttt{AB-tree} under all conditions tested.