From aa9663658d3c3d1380ea67643e66b005b37b48d7 Mon Sep 17 00:00:00 2001 From: Arnaud Giersch Date: Fri, 19 Dec 2014 11:10:46 +0100 Subject: [PATCH] =?utf8?q?Remove=20constant=20factor=20in=20O(F=C2=B7N?= =?utf8?q?=C2=B74).?= MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit --- Heter_paper.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Heter_paper.tex b/Heter_paper.tex index 0203c67..be509e7 100644 --- a/Heter_paper.tex +++ b/Heter_paper.tex @@ -714,7 +714,7 @@ brute force algorithm. It has a small execution time: for a heterogeneous cluster composed of four different types of nodes having the characteristics presented in Table~\ref{table:platform}, it takes on average \np[ms]{0.04} for 4 nodes and \np[ms]{0.15} on average for 144 nodes to compute the best scaling -factors vector. The algorithm complexity is $O(F\cdot (N \cdot4) )$, where $F$ +factors vector. The algorithm complexity is $O(F\cdot N)$, where $F$ is the number of iterations and $N$ is the number of computing nodes. The algorithm needs from 12 to 20 iterations to select the best vector of frequency scaling factors that gives the results of the next sections. -- 2.39.5