From: afanfakh <afanfakh@fanfakh.afanfakh>
Date: Wed, 3 Dec 2014 13:31:53 +0000 (+0100)
Subject: some corrections
X-Git-Tag: pdsec15_submission~44
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/mpi-energy2.git/commitdiff_plain/8ddb81b017ed5ce416eaf656d867ec9b496f2b44

some corrections
---

diff --git a/Heter_paper.tex b/Heter_paper.tex
index 7aeae75..c90258e 100644
--- a/Heter_paper.tex
+++ b/Heter_paper.tex
@@ -1040,7 +1040,7 @@ They developed a green governor that regularly applies an online frequency selec
  To fairly compare both algorithms, the same energy and execution time models, equations (\ref{eq:energy}) and  (\ref{eq:fnew}), were used for both algorithms to predict the energy consumption and the execution times. Also Spiliopoulos et al.  algorithm was adapted to  start the search from the 
 initial frequencies computed using the equation (\ref{eq:Fint}). The resulting algorithm is an exhaustive search algorithm that minimizes the EDP and has the initial frequencies values as an upper bound.
 
-Both algorithms were applied to the parallel NAS benchmarks to compare their efficiency. Table \ref{table:compare_EDP}  presents the results of comparing the execution times and the energy consumptions for both versions of the NAS benchmarks while running the class C of each benchmark over 8 or 9 heterogeneous nodes. . The results show that our algorithm gives better energy savings than Spiliopoulos et al. algorithm, 
+Both algorithms were applied to the parallel NAS benchmarks to compare their efficiency. Table \ref{table:compare_EDP}  presents the results of comparing the execution times and the energy consumptions for both versions of the NAS benchmarks while running the class C of each benchmark over 8 or 9 heterogeneous nodes. The results show that our algorithm gives better energy savings than Spiliopoulos et al. algorithm, 
 on average it results in 29.76\% energy saving while their algorithm returns just 25.75\%. The average of performance degradation percentage is approximately the same for both algorithms, about 4\%. 
 
 For all benchmarks, our algorithm outperforms