From bbad8f82729d451c8310d884a7d25d8c0d0b6be4 Mon Sep 17 00:00:00 2001 From: Eugen Betke Date: Thu, 22 Oct 2020 16:34:58 +0200 Subject: [PATCH] Added: 203 days collection period --- paper/main.tex | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/paper/main.tex b/paper/main.tex index 67c0f60..b0c8c13 100644 --- a/paper/main.tex +++ b/paper/main.tex @@ -92,8 +92,7 @@ When support staff investigates a single job, it is relevant to identify related In this paper, a methodology to rank the similarity of all jobs to a reference job based on their temporal IO behavior is described. Practically, we apply several of previously developed time series based algorithms and also utilize Kolmogorov-Smirnov to compare the distribution of the statistics. A study is conducted to explore the effectivity of the approach which starts starts from three reference jobs and investigates related jobs. -The data stems from DKRZ's supercomputer Mistral and includes more than 500.000 jobs that have been executed during several months of operation. -\jk{Wie lange war das?} +The data stems from DKRZ's supercomputer Mistral and includes more than 500.000 jobs that have been executed during 203 days of operation. %Problem with definition of similarity. Our analysis shows that the strategy and algorithms are effective to identify similar jobs and revealed some interesting patterns on the data.