From 64a582cb25ff9dc233ede1152198c2454f6ba19f Mon Sep 17 00:00:00 2001 From: Eugen Betke Date: Wed, 26 Aug 2020 16:33:47 +0200 Subject: [PATCH] nai --- paper/main.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/paper/main.tex b/paper/main.tex index 1c3a443..1d05aa6 100644 --- a/paper/main.tex +++ b/paper/main.tex @@ -200,7 +200,7 @@ For example, we can see in \Cref{fig:job-S}, that several metrics increase in Se To measure the performance for computing the similarity to the reference jobs, the algorithms are executed 10 times on a compute node at DKRZ. A boxplot for the runtimes is shown in \Cref{fig:performance}. -The runtime is normalized for 100k seconds, i.e., for bin\_all it takes about 41\,s to process 100k jobs out of the 500k total jobs that this algorithm will process. +The runtime is normalized for 100k jobs, i.e., for bin\_all it takes about 41\,s to process 100k jobs out of the 500k total jobs that this algorithm will process. Generally, the bin algorithms are fastest, while the hex algorithms take often 4-5x as long. Hex\_phases is slow for Job-S and Job-M while it is fast for Job-L, the reason is that just one phase is extracted for Job-L. The Levensthein based algorithms take longer for longer jobs -- proportional to the job length as it applies a sliding window.