Browse Source

shorten table description, as the info on benchmark repetition is now located in text above

master
Constantin Fürst 10 months ago
parent
commit
020719f6fd
  1. 4
      thesis/content/60_evaluation.tex

4
thesis/content/60_evaluation.tex

@ -36,7 +36,7 @@ We benchmarked two methods to establish a baseline and an upper limit as referen
\begin{table}[!t] \begin{table}[!t]
\centering \centering
\input{tables/table-qdp-baseline.tex} \input{tables/table-qdp-baseline.tex}
\caption{Table showing raw timing for \gls{qdp} on \glsentryshort{dram} and \gls{hbm}. Result for \glsentryshort{dram} serves as baseline while \glsentryshort{hbm} presents the upper boundary achievable with perfect prefetching. Raw Time is averaged over 5 iterations with previous warm up.}
\caption{Table showing raw timing for \gls{qdp} on \glsentryshort{dram} and \gls{hbm}. Result for \glsentryshort{dram} serves as baseline while \glsentryshort{hbm} presents the upper boundary achievable with perfect prefetching.}
\label{table:qdp-baseline} \label{table:qdp-baseline}
\end{table} \end{table}
@ -72,7 +72,7 @@ To address the challenges posed by sharing memory bandwidth between both \(SCAN\
\begin{table}[!t] \begin{table}[!t]
\centering \centering
\input{tables/table-qdp-speedup.tex} \input{tables/table-qdp-speedup.tex}
\caption{Table showing Speedup for different \glsentryshort{qdp} Configurations over \glsentryshort{dram}. Result for \glsentryshort{dram} serves as baseline while \glsentryshort{hbm} presents the upper boundary achievable with perfect prefetching. Prefetching was performed with the same parameters and data locations as \gls{dram}, caching on Node 8 (\glsentryshort{hbm} accessor for the executing Node 0). Prefetching with Distributed Columns had columns \texttt{a} and \texttt{b} located on different Nodes. Raw Time is averaged over 5 iterations with previous warm up.}
\caption{Table showing Speedup for different \glsentryshort{qdp} Configurations over \glsentryshort{dram}. Result for \glsentryshort{dram} serves as baseline while \glsentryshort{hbm} presents the upper boundary achievable with perfect prefetching. Prefetching was performed with the same parameters and data locations as \gls{dram}, caching on Node 8 (\glsentryshort{hbm} accessor for the executing Node 0). Prefetching with Distributed Columns had columns \texttt{a} and \texttt{b} located on different Nodes.}
\label{table:qdp-speedup} \label{table:qdp-speedup}
\end{table} \end{table}

Loading…
Cancel
Save