Some checks are pending
CI / Julia ${{ matrix.version }} - ${{ matrix.os }} - ${{ matrix.arch }} - ${{ github.event_name }} (x64, ubuntu-latest, 1.10) (push) Waiting to run
CI / Julia ${{ matrix.version }} - ${{ matrix.os }} - ${{ matrix.arch }} - ${{ github.event_name }} (x64, ubuntu-latest, 1.6) (push) Waiting to run
CI / Julia ${{ matrix.version }} - ${{ matrix.os }} - ${{ matrix.arch }} - ${{ github.event_name }} (x64, ubuntu-latest, pre) (push) Waiting to run
84 lines
7.4 KiB
TeX
84 lines
7.4 KiB
TeX
\chapter{Evaluation}
|
|
\label{cha:evaluation}
|
|
|
|
This thesis aims to determine whether one of the two GPU evaluators is faster than the current CPU evaluator. This chapter describes the performance evaluation process. First, the environment in which the performance benchmarks are conducted is explained. Next the individual results for the GPU interpreter and transpiler are presented individually. This section also includes the performance tuning steps taken to achieve these results. Finally, the results of the GPU evaluators are compared to those of the CPU evaluator to answer the research questions of this thesis.
|
|
|
|
\section{Benchmark Environment}
|
|
In this section, the benchmark environment used to evaluate the performance is outlined. To ensure the validity and reliability of the results, it is necessary to specify the details of the environment. This includes a description of the hardware and software configuration as well as the performance evaluation process. With this, the variance between the results is minimised, which allows for better reproducibility and comparability between the implementations.
|
|
|
|
\subsection{Hardware Configuration}
|
|
The hardware configuration is the most important aspect of the benchmark environment. The capabilities of both the CPU and GPU can have a significant impact on the resulting performance. The following sections outline the importance of the individual components as well as the hardware used for the benchmarks.
|
|
|
|
\subsubsection{GPU}
|
|
Especially the GPU is important, as different microarchitectures typically require different optimisations. While the evaluators can generally run on any Nvidia GPU with a compute capability of at least 6.1, they are tuned for the Ampere microarchitecture with a compute capability of 8.6. Despite the evaluators being tuned for this microarchitecture, more modern ones can be used as well. However, additional tuning is required to ensure the evaluators can utilise the hardware to its fullest potential.
|
|
|
|
\subsubsection{CPU}
|
|
Although the GPU plays a crucial role, work is also carried out on the CPU. The interpreter mainly uses the CPU for data transfer and the pre-processing step and is therefore more GPU-bound. However, the transpiler additionally needs the CPU to perform the transpilation step. This step produces a kernel for each expression and also involves sending these kernels to the driver for compilation, a process which is also performed by the CPU. By contrast, the interpreter only has one kernel that needs to be converted into PTX and compiled by the driver only once. Consequently, the transpiler is much more CPU-bound and variations in the used CPU have a much greater impact. Therefore, using a more powerful CPU benefits the transpiler more than the interpreter.
|
|
|
|
\subsubsection{System Memory}
|
|
In addition to the hardware configuration of the GPU and CPU, system memory (RAM) also plays a crucial role. While RAM does not directly contribute to the overall performance, it can have a noticeable indirect impact due to its role in caching. Insufficient RAM forces the operating system to use the page file, which is stored on a much slower SSD. This results in slower cache access, thereby reducing the overall performance of the application.
|
|
|
|
As seen in the list below, only 16 GB of RAM were available during the benchmarking process. This amount is insufficient to utilise caching to the extent outlined in Chapter \ref{cha:implementation}. More RAM was not available, which means some caching had to be disabled, which will be further explained in Section \ref{sec:results}.
|
|
|
|
\subsubsection{Hardware}
|
|
With the requirements explained above in mind, the following hardware is used to perform the benchmarks for the CPU-based evaluator, which was used as the baseline, as well as for the GPU-based evaluators:
|
|
\begin{itemize}
|
|
\item Intel i5 12500
|
|
\item Nvidia RTX 3060 Ti
|
|
\item 16 GB 4400 MT/s DDR5 RAM
|
|
\end{itemize}
|
|
|
|
|
|
\subsection{Software Configuration}
|
|
Apart from the hardware, the performance of the evaluators can also be significantly affected by the software. Primarily these three software components are involved in the performance:
|
|
\begin{itemize}
|
|
\item GPU Driver
|
|
\item Julia
|
|
\item CUDA.jl
|
|
\end{itemize}
|
|
|
|
Typically, newer versions of these components include performance improvements, among other things. This is why it is important to specify the version which is used for benchmarking. The GPU driver uses version \emph{561.17}, Julia uses version \emph{1.11.5}, and CUDA.jl uses version \emph{5.8.1}. As with the hardware configuration, this ensures that the results are reproducible and comparable to each other.
|
|
|
|
|
|
\subsection{Performance evaluation process}
|
|
% explain the actual data
|
|
% Nikuradse dataset (flowrate through rough pipes (fact check that again))
|
|
% 250k expressions; ~300 variable sets; 100 parameter optimisation steps (simulated)
|
|
% using Benchmarktools.jl as a tried and tested benchmark suite
|
|
% 50 samples to eliminate any run-to-run variance
|
|
|
|
|
|
\section{Results}
|
|
\label{sec:results}
|
|
talk about what we will see now (results only for interpreter, then transpiler and then compared with each other and the CPU interpreter)
|
|
|
|
BECAUSE OF RAM CONSTRAINTS, CACHING IS NOT USED TO THE FULL EXTEND AS IN CONTRAST TO HOW IT IS EXPLAINED IN THE IMPLEMENTATION CHAPTER. I hope I can cache the frontend. If only the finished kernels can not be cached, move this explanation to the transpiler section below and update the reference in subsubsection "System Memory"
|
|
|
|
\subsection{Interpreter}
|
|
Results only for Interpreter (also contains final kernel configuration and probably quick overview/recap of the implementation used and described in Implementation section)
|
|
\subsection{Performance Tuning}
|
|
Document the process of performance tuning
|
|
|
|
Initial: no cache; 256 blocksize; exprs pre-processed and sent to GPU on every call; vars sent on every call; frontend + dispatch are multithreaded
|
|
|
|
1.) Done before parameter optimisation loop: Frontend, transmitting Exprs and Variables (improved runtime)
|
|
2.) tuned blocksize to have as little wasted threads as possible (new blocksize 121 -> 3-blocks -> 363 threads but 362 threads needed per expression)
|
|
|
|
|
|
\subsection{Transpiler}
|
|
Results only for Transpiler (also contains final kernel configuration and probably quick overview/recap of the implementation used and described in Implementation section
|
|
|
|
|
|
|
|
\subsection{Performance Tuning}
|
|
Document the process of performance tuning
|
|
|
|
Initial: no cache; 256 blocksize; exprs pre-processed and transpiled on every call; vars sent on every call; frontend + transpilation + dispatch are multithreaded
|
|
|
|
1.) Done before parameter optimisation loop: Frontend, transmitting Exprs and Variables (improved runtime)
|
|
2.) All expressions to execute are transpiled first (before they were transpiled for every execution, even in parameter optimisation scenarios). Compilation is still done every time, because too little RAM was available (compilation takes the most time, so this is only a minor boost). Also tried blocksize of 121. However, kernel itself is very fast anyway, so this didn't make a difference (further proof that the CPU is the bottleneck here)
|
|
|
|
\subsection{Comparison}
|
|
Comparison of Interpreter and Transpiler as well as Comparing the two with CPU interpreter
|
|
|
|
talk about that compute portion is just too little. Only more complex expressions with higher var set count benefit well (make one or two performance evaluations, with 10 larger expressions and at least 1k var sets and present that here as point for that statement) |