From: Arnaud Giersch <arnaud.giersch@univ-fcomte.fr>
Date: Fri, 19 Dec 2014 10:10:46 +0000 (+0100)
Subject: Remove constant factor in O(F·N·4).
X-Git-Tag: pdsec15_submission~17
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/mpi-energy2.git/commitdiff_plain/aa9663658d3c3d1380ea67643e66b005b37b48d7?ds=inline;hp=--cc

Remove constant factor in O(F·N·4).
---

aa9663658d3c3d1380ea67643e66b005b37b48d7
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.