+\textcolor{blue}{
+The energy saving percentages of NAS benchmarks with these three static power scenarios are presented
+in figure \ref{fig:eng_sen}. This figure shows that 10\% of static power scenario
+gives the biggest energy saving percentage comparing to 20\% and 30\% static power
+scenarios. The smaller ratio of the static power consumption makes the proposed
+scaling algorithm to select smaller frequencies, bigger scaling factors.
+These smaller frequencies has reduced the dynamic energy consumption and thus the
+overall energy consumption is decreased.
+The energy saving percentages of 30\% static power scenario is the smallest between the other scenarios, because of the scaling algorithm selects bigger frequencies, smaller scaling factors, that increased the energy consumption. For example, figure \ref{fig:fre-pow}, illustrates that the proposed scaling algorithm is proportionally selected the best frequency scaling factors according to the static power consumption ratio being used.
+Furthermore, the proposed scaling algorithm tries to limit selecting smaller frequencies, which increased the execution time. Hence, the increase in the execution time is relatively increased the static energy consumption.
+The performance degradation percentages are presented in the figure \ref{fig:per-pow},
+the 30\% of static power scenario had less performance degradation percentage. This because
+bigger frequencies was selected due to the big ratio in the static power consumption.
+The inverse happens in the 20\% and 30\% scenarios, the scaling algorithm is selecting
+smaller frequencies, bigger scaling factors, according to the ratio of the static power.
+The tradeoff distance percentage for the NAS benchmarks with these three static power scenarios
+are presented in the figure \ref{fig:dist}. It shows that the tradeoff
+distance percentage is the best when the 10\% of static power scenario is used, and this percentage
+is decreased for the other two scenarios propositionally to their static power ratios.
+In EP benchmark, the results of energy saving, performance degradation and tradeoff
+distance are showed small differences when the these static power scenarios were used.
+The absent of the communications in this benchmark made the proposed scaling algorithm to select equivalent frequencies even if the static power values are different. While, the
+inverse has been shown for the rest of the benchmarks, which have different communication times
+that increased the static energy consumption proportionally. Therefore, the scaling algorithm relatively selects
+different frequencies for each benchmark when these static power scenarios are used. }
+
+
+\subsection{The comparison of the proposed frequencies selecting algorithm }
+\label{sec.compare_EDP}
+\textcolor{blue}{
+The tradeoff between the energy consumption and the performance of the parallel
+applications had significant importance in the domain of the research.
+Many researchers, \cite{EDP_for_multi_processors,Energy_aware_application_scheduling,Exploring_Energy_Performance_TradeOffs},
+have optimized the tradeoff between the energy and the performance using the well known energy and delay product, $EDP=energy \times delay$.
+This model is also used by Spiliopoulos et al. algorithm \cite{Spiliopoulos_Green.governors.Adaptive.DVFS},
+the objective is to select the frequencies that minimized EDP product for the multi-cores
+architecture when DVFS is used. Moreover, their algorithm is applied online, which synchronously optimized the energy consumption
+and the execution time. Both energy consumption and execution time of a processor are predicted by the their algorithm.
+In this section the proposed frequencies selection algorithm, called Maxdist is compared with Spiliopoulos et al. algorithm, called EDP.
+To make both of the algorithms follow the same direction and fairly comparing them, the same energy model, equation \ref{eq:energy} and
+the execution time model, equation \ref{eq:perf}, are used in the prediction process to select the best vector of the frequencies.
+In contrast, the proposed algorithm starts the search space from the lower bound computed as in equation the \ref{eq:Fint}. Also, the algorithm
+stops the search process when it is reached to the lower bound as mentioned before. In the same way, the EDP algorithm is developed to start from the
+same upper bound used in Maxdist algorithm, and it stops the search process when a minimum available frequencies is reached.
+Finally, the resulting EDP algorithm is an exhaustive search algorithm that test all possible frequencies, starting from the initial frequencies,
+and selecting those minimized the EDP product.
+Both algorithms were applied to NAS benchmarks, class D, over 16 nodes selected from grid'5000 clusters.
+The participating computing nodes are distributed between two sites and one site to have two different scenarios that used in the section \ref{sec.res}.
+The experimental results: the energy saving, performance degradation and tradeoff distance percentages are
+presented in the figures \ref{fig:edp-eng}, \ref{fig:edp-perf} and \ref{fig:edp-dist} respectively.
+\begin{figure}
+ \centering
+ \includegraphics[scale=0.5]{fig/edp_eng}
+ \caption{Comparing of the energy saving for the proposed method with EDP method}
+ \label{fig:edp-eng}
+\end{figure}
+\begin{figure}
+ \centering
+ \includegraphics[scale=0.5]{fig/edp_per}
+ \caption{Comparing of the performance degradation for the proposed method with EDP method}
+ \label{fig:edp-perf}
+\end{figure}
+\begin{figure}
+ \centering
+ \includegraphics[scale=0.5]{fig/edp_dist}
+ \caption{Comparing of the tradeoff distance for the proposed method with EDP method}
+ \label{fig:edp-dist}
+\end{figure}
+As shown form these figures, the proposed frequencies selection algorithm, Maxdist, outperform the EDP algorithm in term of energy and performance for all of the benchmarks executed over the two scenarios.
+Generally, the proposed algorithm gives better results for all benchmarks because it is
+optimized the distance between the energy saving and the performance degradation in the same time.
+Moreover, the proposed scaling algorithm gives the same weight for these two metrics.
+Whereas, the EDP algorithm gives some times negative tradeoff values for some benchmarks in the two sites scenarios.
+These negative tradeoff values mean that the performance degradation percentage is higher than energy saving percentage.
+The higher positive value of the tradeoff distance percentage mean that the energy saving percentage is much higher than the performance degradation percentage.
+The time complexity of both Maxdist and EDP algorithms are $O(N \cdot M \cdot F)$ and
+$O(N \cdot M \cdot F^2)$ respectively. Where $N$ is the number of the clusters, $M$ is the number of nodes and $F$ is the
+maximum number of available frequencies. The proposed algorithm, Maxdist, has selected the best frequencies in a small execution time,
+on average is equal to 0.01 $ms$, when it is executed over 32 nodes distributed between Nancy and Lyon sites.
+While the EDP algorithm was slower than Maxdist algorithm by ten times over the same number of nodes and same distribution, its execution time on average
+is equal to 0.1 $ms$.
+}
