From e0039390b09e802a66c2be4842dd95fee695b433 Mon Sep 17 00:00:00 2001
From: Douglas Rumbaugh <dbr4@psu.edu>
Date: Mon, 2 Jun 2025 20:31:18 -0400
Subject: Updates

---
 chapters/tail-latency.tex | 44 +++++++++++++++++++++++++++++++++++++++++---
 1 file changed, 41 insertions(+), 3 deletions(-)

(limited to 'chapters/tail-latency.tex')

diff --git a/chapters/tail-latency.tex b/chapters/tail-latency.tex
index c3cf5b7..0cdeeab 100644
--- a/chapters/tail-latency.tex
+++ b/chapters/tail-latency.tex
@@ -142,9 +142,9 @@ re-partitioning is used, the worst case cost rises to the now familiar $I(n)
 \begin{figure}
 \centering
 \subfloat[Insertion vs. Query Trade-off]{\includegraphics[width=.5\textwidth]{img/tail-latency/ebm-count-sweep.pdf}\label{fig:tl-ebm-tradeoff}} 
-\subfloat[Insertion Latency Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/ebm-count-sweep.pdf} \label{fig:tl-ebm-tail-latency}} \\
+\subfloat[Insertion Latency Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/ebm-latency-dist.pdf} \label{fig:tl-ebm-tail-latency}} \\
 
-\caption{The equal block method with $f(n) = C$ for varying values of C. \textbf{Plots not yet populated}}
+\caption{The equal block method with $f(n) = C$ for varying values of C.}
 \label{fig:tl-ebm}
 \end{figure}
 
@@ -526,6 +526,7 @@ are done in time to maintain the block bound given $\log n$ parallel threads.
 
 
 \section{Implementation}
+\label{sec:tl-impl}
 
 The previous section demonstrated that, theoretically, it is possible
 to meaningfully control the tail latency of our dynamization system by
@@ -918,7 +919,44 @@ space associated with the parameter to the user.
 \section{Evaluation}
 \label{sec:tl-eval}
 
-\subsection{}
+In this section, we perform several experiments to evaluate the ability of
+the system proposed in Section~\ref{sec:tl-impl} to control tail latencies.
+
+\subsection{Stall Proportion Sweep}
+
+\begin{figure}
+\centering
+\subfloat[Insertion Latency Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/200m-stall-insert-dist.pdf} \label{fig:tl-btree-isam-tput}} 
+\subfloat[Shard Count Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/200m-stall-shard-dist.pdf} \label{fig:tl-btree-isam-lat}} \\
+\caption{Insertion and Shard Count Distributions for ISAM with 200M Records}
+\label{fig:tl-stall-200m}
+\end{figure}
+
+First, we will consider the insertion and query performance of our system
+at a variety of stall proportions. 
+
+
+\begin{figure}
+\centering
+\subfloat[Insertion Latency Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/4b-stall-insert-dist.pdf} \label{fig:tl-btree-isam-tput}} 
+\subfloat[Shard Count Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/4b-stall-shard-dist.pdf} \label{fig:tl-btree-isam-lat}} \\
+\caption{Insertion and Shard Count Distributions for ISAM with 4B Records}
+\label{fig:tl-stall-4b}
+\end{figure}
+
+\begin{figure}
+\subfloat[Insertion Latency Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/knn-stall-insert-dist.pdf} \label{fig:tl-btree-isam-tput}} 
+\subfloat[Shard Count Distribution]{\includegraphics[width=.5\textwidth]{img/tail-latency/knn-stall-shard-dist.pdf} \label{fig:tl-btree-isam-lat}} \\
+\caption{Insertion and Shard Count Distributions for VPTree }
+\label{fig:tl-stall-knn}
+\end{figure}
+
+\begin{figure}
+\centering
+\includegraphics[width=.5\textwidth]{img/tail-latency/stall-latency-curve.pdf}
+\caption{Insertion Throughput vs. Query Latency for ISAM with 200M Records}
+\label{fig:tl-latency-curve}
+\end{figure}
 
 
 \section{Conclusion}
-- 
cgit v1.2.3

