% paper in homogeneous clusters}
\subsection{The execution time of message passing distributed iterative applications on a heterogeneous platform}
-In this paper, we are interested in reducing the energy consumption of message passing distributed iterative synchronous applications running over heterogeneous platforms. We define a heterogeneous platform as a collection of heterogeneous computing nodes interconnected via a high speed homogeneous network. Therefore, each node has different characteristics such as computing power (FLOPS), energy consumption, cpu's frequency range, ... but they all have the same network bandwidth and latency.
+
+In this paper, we are interested in reducing the energy consumption of message
+passing distributed iterative synchronous applications running over
+heterogeneous platforms. We define a heterogeneous platform as a collection of
+heterogeneous computing nodes interconnected via a high speed homogeneous
+network. Therefore, each node has different characteristics such as computing
+power (FLOPS), energy consumption, CPU's frequency range, \dots{} but they all
+have the same network bandwidth and latency.
\begin{figure}[t]
The execution time of a compute bound sequential program is linearly proportional to the frequency scaling factor $S$.
On the other hand, message passing distributed applications consist of two parts: computation and communication. The execution time of the computation part is linearly proportional to the frequency scaling factor $S$ but the communication time is not affected by the scaling factor because the processors involved remain idle during the communications~\cite{17}. The communication time for a task is the summation of periods of time that begin with an MPI call for sending or receiving a message till the message is synchronously sent or received.
-Since in a heterogeneous platform, each node has different characteristics, especially different frequency gears, when applying DVFS operations on these nodes, they may get different scaling factors represented by a scaling vector: $(S_1, S_2,..., S_N)$ where $S_i$ is the scaling factor of processor $i$. To be able to predict the execution time of message passing synchronous iterative applications running over a heterogeneous platform, for different vectors of scaling factors, the communication time and the computation time for all the
- tasks must be measured during the first iteration before applying any DVFS operation. Then the execution time for one iteration of the application with any vector of scaling factors can be predicted using EQ (\ref{eq:perf}).
-
-
-
-\begin{multline}
+Since in a heterogeneous platform, each node has different characteristics,
+especially different frequency gears, when applying DVFS operations on these
+nodes, they may get different scaling factors represented by a scaling vector:
+$(S_1, S_2,\dots, S_N)$ where $S_i$ is the scaling factor of processor $i$. To
+be able to predict the execution time of message passing synchronous iterative
+applications running over a heterogeneous platform, for different vectors of
+scaling factors, the communication time and the computation time for all the
+tasks must be measured during the first iteration before applying any DVFS
+operation. Then the execution time for one iteration of the application with any
+vector of scaling factors can be predicted using EQ (\ref{eq:perf}).
+\begin{equation}
\label{eq:perf}
\textit T_\textit{new} =
- {} \max_{i=1,2,\dots,N} (TcpOld_{i} \cdot S_{i}) + TcmOld_{j}
-\end{multline}
+ \max_{i=1,2,\dots,N} (TcpOld_{i} \cdot S_{i}) + TcmOld_{j}
+\end{equation}
where $TcpOld_i$ is the computation time of processor $i$ during the first iteration and $TcmOld_j$ is the communication time of the slowest processor $j$.
The model computes the maximum computation time
with scaling factor from each node added to the communication time of the slowest node, it means only the
$F_{new}$ from EQ(\ref{eq:s}) as follow:
\begin{equation}
\label{eq:fnew}
- F_\textit{new} = S^{-1} . F_\textit{max}
+ F_\textit{new} = S^{-1} \cdot F_\textit{max}
\end{equation}
Replacing $F_{new}$ in EQ(\ref{eq:pd}) as in EQ(\ref{eq:fnew}) gives the following equation for dynamic
power consumption:
\begin{multline}
\label{eq:pdnew}
{P}_\textit{dNew} = \alpha \cdot C_L \cdot V^2 \cdot F_{new} = \alpha \cdot C_L \cdot \beta^2 \cdot F_{new}^3 \\
- = \alpha \cdot C_L \cdot V^2 \cdot F \cdot S^{-3} = P_{dOld} \cdot S^{-3}
+ {} = \alpha \cdot C_L \cdot V^2 \cdot F \cdot S^{-3} = P_{dOld} \cdot S^{-3}
\end{multline}
where $ {P}_\textit{dNew}$ and $P_{dOld}$ are the dynamic power consumed with the new frequency and the maximum frequency respectively.
the execution time of the program is the summation of the computation and the communication times. The computation time is linearly related
to the frequency scaling factor, while this scaling factor does not affect the communication time. The static energy
of a processor after scaling its frequency is computed as follows:
-
\begin{equation}
\label{eq:Estatic}
E_\textit{s} = P_\textit{s} \cdot (T_{cp} \cdot S + T_{cm})
In the considered heterogeneous platform, each processor $i$ might have different dynamic and static powers, noted as $P_{di}$ and $P_{si}$ respectively. Therefore, even if the distributed message passing iterative application is load balanced, the computation time of each CPU $i$ noted $T_{cpi}$ might be different and different frequency scaling factors might be computed in order to decrease the overall energy consumption of the application and reduce the slack times. The communication time of a processor $i$ is noted as $T_{cmi}$ and could contain slack times if it is communicating with slower nodes, see figure(\ref{fig:heter}). Therefore, all nodes do not have equal communication times. While the dynamic energy is computed according to the frequency scaling factor and the dynamic power of each node as in EQ(\ref{eq:Edyn}), the static energy is computed as the sum of the execution time of each processor multiplied by its static power. The overall energy consumption of a message passing distributed application executed over a heterogeneous platform is the summation of all dynamic and static energies for each processor. It is computed as follows:
\begin{multline}
\label{eq:energy}
- E = \sum_{i=1}^{N} {(S_i^{-2} \cdot P_{di} \cdot T_{cpi})} +\\
- {}\sum_{i=1}^{N} {(P_{si} \cdot (\max_{i=1,2,\dots,N} (T_{cpi} \cdot S_{i}) +}
- {}\min_{i=1,2,\dots,N} {T_{cmi}))}
+ E = \sum_{i=1}^{N} {(S_i^{-2} \cdot P_{di} \cdot T_{cpi})} + {} \\
+ \sum_{i=1}^{N} (P_{si} \cdot (\max_{i=1,2,\dots,N} (T_{cpi} \cdot S_{i}) +
+ \min_{i=1,2,\dots,N} {T_{cmi}))}
\end{multline}
-Reducing the the frequencies of the processors according to the vector of scaling factors $(S_1, S_2,..., S_N)$ may degrade the performance of the application and thus,
-increase the static energy because the execution time is increased~\cite{36}.
+Reducing the the frequencies of the processors according to the vector of
+scaling factors $(S_1, S_2,\dots, S_N)$ may degrade the performance of the
+application and thus, increase the static energy because the execution time is
+increased~\cite{36}.
\section{Optimization of both energy consumption and performance}
\label{sec.compet}
-Applying DVFS to lower level not surly reducing the energy consumption to minimum level. Also, a big scaling for the frequency produces high performance degradation percent. Moreover, by considering the drastically increase in execution time of parallel program, the static energy is related to this time
-and it also increased by the same ratio. Thus, the opportunity for gaining more energy reduction is restricted. For that choosing frequency scaling factors is very important process to taking into account both energy and performance. In our previous work~\cite{45}, we are proposed a method that selects the optimal frequency scaling factor for an homogeneous cluster, depending on the trade-off relation between the energy and performance. In this work we have an heterogeneous cluster, at each node there is different scaling factors, so our goal is to selects the optimal set of frequency scaling factors, $Sopt_1,Sopt_2,...,Sopt_N$, that gives the best trade-off between energy consumption and performance. The relation between the energy and the execution time is complex and nonlinear, Thus, unlike the relation between the performance and the scaling factor, the relation of the energy with the frequency scaling factors is nonlinear, for more details refer to~\cite{17}. Moreover, they are not measured using the same metric. To solve this problem, we normalize the execution time by calculating the ratio between the new execution time (the scaled execution time) and the old one as follow:
+
+Applying DVFS to lower level not surly reducing the energy consumption to
+minimum level. Also, a big scaling for the frequency produces high performance
+degradation percent. Moreover, by considering the drastically increase in
+execution time of parallel program, the static energy is related to this time
+and it also increased by the same ratio. Thus, the opportunity for gaining more
+energy reduction is restricted. For that choosing frequency scaling factors is
+very important process to taking into account both energy and performance. In
+our previous work~\cite{45}, we are proposed a method that selects the optimal
+frequency scaling factor for an homogeneous cluster, depending on the trade-off
+relation between the energy and performance. In this work we have an
+heterogeneous cluster, at each node there is different scaling factors, so our
+goal is to selects the optimal set of frequency scaling factors,
+$Sopt_1,Sopt_2,\dots,Sopt_N$, that gives the best trade-off between energy
+consumption and performance. The relation between the energy and the execution
+time is complex and nonlinear, Thus, unlike the relation between the performance
+and the scaling factor, the relation of the energy with the frequency scaling
+factors is nonlinear, for more details refer to~\cite{17}. Moreover, they are
+not measured using the same metric. To solve this problem, we normalize the
+execution time by calculating the ratio between the new execution time (the
+scaled execution time) and the old one as follow:
\begin{multline}
\label{eq:pnorm}
P_\textit{Norm} = \frac{T_\textit{New}}{T_\textit{Old}}\\
- = \frac{ \max_{i=1,2,\dots,N} (Tcp_{i} \cdot S_{i}) +\min_{i=1,2,\dots,N} {Tcm_{i}}}
+ {} = \frac{ \max_{i=1,2,\dots,N} (Tcp_{i} \cdot S_{i}) +\min_{i=1,2,\dots,N} {Tcm_{i}}}
{\max_{i=1,2,\dots,N}{(Tcp_i+Tcm_i)}}
\end{multline}
\begin{multline}
\label{eq:enorm}
E_\textit{Norm} = \frac{E_\textit{Reduced}}{E_\textit{Original}} \\
- = \frac{ \sum_{i=1}^{N}{(S_i^{-2} \cdot Pd_i \cdot Tcp_i)} +
+ {} = \frac{ \sum_{i=1}^{N}{(S_i^{-2} \cdot Pd_i \cdot Tcp_i)} +
\sum_{i=1}^{N} {(Ps_i \cdot T_{New})}}{\sum_{i=1}^{N}{( Pd_i \cdot Tcp_i)} +
\sum_{i=1}^{N} {(Ps_i \cdot T_{Old})}}
\end{multline}
-Where $T_{New}$ and $T_{Old}$ is computed as in EQ(\ref{eq:pnorm}). The second problem
-is that the optimization operation for both energy and performance is not in the same direction.
-In other words, the normalized energy and the normalized execution time curves are not at the same direction.
-While the main goal is to optimize the energy and execution time in the same time. According to the
-equations~(\ref{eq:enorm}) and~(\ref{eq:pnorm}), the set of frequency scaling factors $S_1,S_2,...,S_N$ reduce both the energy and the
-execution time simultaneously. But the main objective is to produce maximum energy
-reduction with minimum execution time reduction. Many researchers used different
-strategies to solve this nonlinear problem for example see~\cite{19,42}, their
-methods add big overheads to the algorithm to select the suitable frequency.
-In this paper we are present a method to find the optimal set of frequency scaling factors to optimize both energy and execution time simultaneously
-without adding a big overhead. Our solution for this problem is to make the optimization process
-for energy and execution time follow the same direction. Therefore, we inverse the equation of the normalized
-execution time, the normalized performance, as follows:
-
+Where $T_{New}$ and $T_{Old}$ is computed as in EQ(\ref{eq:pnorm}). The second
+problem is that the optimization operation for both energy and performance is
+not in the same direction. In other words, the normalized energy and the
+normalized execution time curves are not at the same direction. While the main
+goal is to optimize the energy and execution time in the same time. According
+to the equations~(\ref{eq:enorm}) and~(\ref{eq:pnorm}), the set of frequency
+scaling factors $S_1,S_2,\dots,S_N$ reduce both the energy and the execution
+time simultaneously. But the main objective is to produce maximum energy
+reduction with minimum execution time reduction. Many researchers used
+different strategies to solve this nonlinear problem for example
+see~\cite{19,42}, their methods add big overheads to the algorithm to select the
+suitable frequency. In this paper we are present a method to find the optimal
+set of frequency scaling factors to optimize both energy and execution time
+simultaneously without adding a big overhead. Our solution for this problem is
+to make the optimization process for energy and execution time follow the same
+direction. Therefore, we inverse the equation of the normalized execution time,
+the normalized performance, as follows:
\begin{multline}
\label{eq:pnorm_inv}
P_\textit{Norm} = \frac{T_\textit{Old}}{T_\textit{New}}\\
represents the minimum energy consumption with minimum execution time (better
performance) at the same time, see figure~(\ref{fig:r1}) or figure~(\ref{fig:r2}) . Then our objective
function has the following form:
-\begin{multline}
+\begin{equation}
\label{eq:max}
Max Dist =
\max_{i=1,\dots F, j=1,\dots,N}
(\overbrace{P_\textit{Norm}(S_{ij})}^{\text{Maximize}} -
\overbrace{E_\textit{Norm}(S_{ij})}^{\text{Minimize}} )
-\end{multline}
+\end{equation}
where $N$ is the number of nodes and $F$ is the number of available frequencies for each nodes.
Then we can select the optimal set of scaling factors that satisfies EQ~(\ref{eq:max}). Our objective function can
work with any energy model or energy values stored in a data file.
\section{The heterogeneous scaling algorithm }
\label{sec.optim}
-In this section we proposed an heterogeneous scaling algorithm, (figure~\ref{HSA}), that selects the optimal set of scaling factors from each node.
-The algorithm is numerates the suitable range of available scaling factors for each node in the heterogeneous cluster, returns a set of optimal frequency scaling factors for each node. Using heterogeneous cluster is produces different workloads for each node. Therefore, the fastest nodes waiting at the barrier for the slowest nodes to finish there work as in figure (\ref{fig:heter}). Our algorithm takes into account these imbalanced workloads when is starts to search for selecting the best scaling factors. So, the algorithm is selecting the initial frequencies values for each node proportional to the times of computations that gathered from the first iteration. As an example in figure (\ref{fig:st_freq}), the algorithm don't test the first frequencies of the fastest nodes until it converge their frequencies to the frequency of the slowest node. If the algorithm is starts test changing the frequency of the slowest nodes from beginning, we are loosing performance and then not selecting the best tradeoff (the distance). This case will be similar to the homogeneous cluster when all nodes scales their frequencies together from the beginning. In this case there is a small distance between energy and performance curves, for example see the figure(\ref{fig:r1}). Then the algorithm searching for optimal frequency scaling factor from the selected frequencies until the last available ones.
+
+In this section we proposed an heterogeneous scaling algorithm,
+(figure~\ref{HSA}), that selects the optimal set of scaling factors from each
+node. The algorithm is numerates the suitable range of available scaling
+factors for each node in the heterogeneous cluster, returns a set of optimal
+frequency scaling factors for each node. Using heterogeneous cluster is produces
+different workloads for each node. Therefore, the fastest nodes waiting at the
+barrier for the slowest nodes to finish there work as in figure
+(\ref{fig:heter}). Our algorithm takes into account these imbalanced workloads
+when is starts to search for selecting the best scaling factors. So, the
+algorithm is selecting the initial frequencies values for each node proportional
+to the times of computations that gathered from the first iteration. As an
+example in figure (\ref{fig:st_freq}), the algorithm don't test the first
+frequencies of the fastest nodes until it converge their frequencies to the
+frequency of the slowest node. If the algorithm is starts test changing the
+frequency of the slowest nodes from beginning, we are loosing performance and
+then not selecting the best trade-off (the distance). This case will be similar
+to the homogeneous cluster when all nodes scales their frequencies together from
+the beginning. In this case there is a small distance between energy and
+performance curves, for example see the figure(\ref{fig:r1}). Then the
+algorithm searching for optimal frequency scaling factor from the selected
+frequencies until the last available ones.
\begin{figure}[t]
\centering
\includegraphics[scale=0.5]{fig/start_freq}
\item[$Ps_i$] array of the static powers for all nodes.
\item[$Fdiff_i$] array of the difference between two successive frequencies for all nodes.
\end{description}
- \Ensure $Sopt_1, \dots ,Sopt_N$ is a set of optimal scaling factors
+ \Ensure $Sopt_1, \dots, Sopt_N$ is a set of optimal scaling factors
\State $ Scp_i \gets \frac{\max_{i=1,2,\dots,N}(Tcp_i)}{Tcp_i} $
\State $F_{i} \gets \frac{Fmax_i}{Scp_i},~{i=1,2,\cdots,N}$
\State Round the computed initial frequencies $F_i$ to the closest one available in each node.
\If{(not the first frequency)}
- \State $F_i \gets F_i+Fdiff_i,~i=1,...,N.$
+ \State $F_i \gets F_i+Fdiff_i,~i=1,\dots,N.$
\EndIf
- \State $T_\textit{Old} \gets max_{~i=1,...,N } (Tcp_i+Tcm_i)$
+ \State $T_\textit{Old} \gets max_{~i=1,\dots,N } (Tcp_i+Tcm_i)$
\State $E_\textit{Original} \gets \sum_{i=1}^{N}{( Pd_i \cdot Tcp_i)} +\sum_{i=1}^{N} {(Ps_i \cdot T_{Old})}$
\State $Dist \gets 0$
- \State $Sopt_{i} \gets 1,~i=1,...,N. $
+ \State $Sopt_{i} \gets 1,~i=1,\dots,N. $
\While {(all nodes not reach their minimum frequency)}
\If{(not the last freq. \textbf{and} not the slowest node)}
- \State $F_i \gets F_i - Fdiff_i,~i=1,...,N.$
- \State $S_i \gets \frac{Fmax_i}{F_i},~i=1,...,N.$
+ \State $F_i \gets F_i - Fdiff_i,~i=1,\dots,N.$
+ \State $S_i \gets \frac{Fmax_i}{F_i},~i=1,\dots,N.$
\EndIf
\State $T_{New} \gets max_\textit{~i=1,\dots,N} (Tcp_{i} \cdot S_{i}) + min_\textit{~i=1,\dots,N}(Tcm_i) $
\State $E_\textit{Reduced} \gets \sum_{i=1}^{N}{(S_i^{-2} \cdot Pd_i \cdot Tcp_i)} + $ \hspace*{43 mm}
\State $ P_\textit{Norm} \gets \frac{T_\textit{Old}}{T_\textit{New}}$
\State $E_\textit{Norm}\gets \frac{E_\textit{Reduced}}{E_\textit{Original}}$
\If{$(\Pnorm - \Enorm > \Dist)$}
- \State $Sopt_{i} \gets S_{i},~i=1,...,N. $
+ \State $Sopt_{i} \gets S_{i},~i=1,\dots,N. $
\State $\Dist \gets \Pnorm - \Enorm$
\EndIf
\EndWhile
- \State Return $Sopt_1,Sopt_2, \dots ,Sopt_N$
+ \State Return $Sopt_1,Sopt_2,\dots,Sopt_N$
\end{algorithmic}
\caption{Heterogeneous scaling algorithm}
\label{HSA}
\end{figure}
-When the initial frequencies are computed the algorithm numerates all available scaling factors starting from these frequencies until all nodes reach their
-minimum frequencies. At each iteration the algorithm remains the frequency of the slowest node without change and scaling the frequency of the other nodes. This is gives better performance and energy tradeoff.
-The proposed algorithm works online during the execution time of the MPI
-program. Its returns a set of optimal frequency scaling factors $Sopt_i$ depending on the objective function EQ(\ref{eq:max}). The program changes the new frequencies of the CPUs according to the computed scaling factors. This algorithm has a small execution time:
-for an heterogeneous cluster composed of four different types of nodes having the characteristics presented in
-table~(\ref{table:platform}), it takes \np[ms]{0.04} on average for 4 nodes and
-\np[ms]{0.1} on average for 128 nodes. The algorithm complexity is $O(F\cdot (N \cdot4) )$,
-where $F$ is the number of iterations and $N$ is the number of
-computing nodes. The algorithm needs on average from 12 to 20 iterations for all the NAS benchmark on class C to selects the best set of frequency scaling factors. Its called just once during the execution of the program. The DVFS figure~(\ref{dvfs}) shows where and when the algorithm is
-called in the MPI program.
+When the initial frequencies are computed the algorithm numerates all available
+scaling factors starting from these frequencies until all nodes reach their
+minimum frequencies. At each iteration the algorithm remains the frequency of
+the slowest node without change and scaling the frequency of the other
+nodes. This is gives better performance and energy trade-off. The proposed
+algorithm works online during the execution time of the MPI program. Its
+returns a set of optimal frequency scaling factors $Sopt_i$ depending on the
+objective function EQ(\ref{eq:max}). The program changes the new frequencies of
+the CPUs according to the computed scaling factors. This algorithm has a small
+execution time: for an heterogeneous cluster composed of four different types of
+nodes having the characteristics presented in table~(\ref{table:platform}), it
+takes \np[ms]{0.04} on average for 4 nodes and \np[ms]{0.1} on average for 128
+nodes. The algorithm complexity is $O(F\cdot (N \cdot4) )$, where $F$ is the
+number of iterations and $N$ is the number of computing nodes. The algorithm
+needs on average from 12 to 20 iterations for all the NAS benchmark on class C
+to selects the best set of frequency scaling factors. Its called just once
+during the execution of the program. The DVFS figure~(\ref{dvfs}) shows where
+and when the algorithm is called in the MPI program.
\begin{figure}[tp]
\begin{algorithmic}[1]
% \footnotesize
\section{Experimental results}
\label{sec.expe}
-The experiments of this work are executed on the simulator Simgrid/SMPI
+The experiments of this work are executed on the simulator SimGrid/SMPI
v3.10~\cite{casanova+giersch+legrand+al.2014.versatile}. We configure the
simulator to use a heterogeneous cluster with one core per node. The proposed
heterogeneous cluster has four different types of nodes. Each node in cluster
details see the Intel data sheets in \cite{47}. Each node has a percentage of
80\% for dynamic power and 20\% for static power from the hole power
consumption, the same assumption is made in \cite{45,3}. These nodes are
-connected via an ethernet network with 1 Gbit/s bandwidth.
+connected via an Ethernet network with 1 Gbit/s bandwidth.
\begin{table}[htb]
\caption{Heterogeneous nodes characteristics}
% title of Table
\subfloat[Imbalanced nodes type scenario]{%
\includegraphics[width=.23185\textwidth]{fig/avg_neq}\label{fig:avg_neq}}
\label{fig:avg}
- \caption{The average of energy and performance for all Nas benchmarks running with difference number of nodes}
+ \caption{The average of energy and performance for all NAS benchmarks running with difference number of nodes}
\end{figure}
-In the NAS benchmarks there are some programs executed on different number of nodes. The benchmarks CG, MG, LU and FT executed on 2 to a power of (1, 2, 4, 8, ...) of nodes. The other benchmarks such as BT and SP executed on 2 to a power of (1, 2, 4, 9, ...) of nodes. We are take the average of energy saving, performance degradation and distances for all results of NAS benchmarks. The average of these three objectives are plotted to the number of nodes as in plots (\ref{fig:avg_eq} and \ref{fig:avg_neq}). In CG, MG, LU, and FT benchmarks the average of energy saving is decreased when the number of nodes is increased due to the increasing in the communication times as mentioned before. Thus, the average of distances (our objective function) is decreased linearly with energy saving while keeping the average of performance degradation the same. In BT and SP benchmarks, the average of energy saving is not decreased significantly compare to other benchmarks when the number of nodes is increased. Nevertheless, the average of performance degradation approximately still the same ratio. This difference is depends on the characteristics of the benchmarks such as the computation to communication ratio that has.
+In the NAS benchmarks there are some programs executed on different number of
+nodes. The benchmarks CG, MG, LU and FT executed on 2 to a power of (1, 2, 4, 8,
+\dots{}) of nodes. The other benchmarks such as BT and SP executed on 2 to a
+power of (1, 2, 4, 9, \dots{}) of nodes. We are take the average of energy
+saving, performance degradation and distances for all results of NAS
+benchmarks. The average of these three objectives are plotted to the number of
+nodes as in plots (\ref{fig:avg_eq} and \ref{fig:avg_neq}). In CG, MG, LU, and
+FT benchmarks the average of energy saving is decreased when the number of nodes
+is increased due to the increasing in the communication times as mentioned
+before. Thus, the average of distances (our objective function) is decreased
+linearly with energy saving while keeping the average of performance degradation
+the same. In BT and SP benchmarks, the average of energy saving is not decreased
+significantly compare to other benchmarks when the number of nodes is
+increased. Nevertheless, the average of performance degradation approximately
+still the same ratio. This difference is depends on the characteristics of the
+benchmarks such as the computation to communication ratio that has.
\subsection{The results for different powers scenarios}
-The results of the previous section are obtained using a percentage of 80\% for dynamic power and 20\% for static power of total power consumption. In this section we are change these ratio by using two others scenarios. Because is interested to measure the ability of the proposed algorithm to changes it behaviour when these power ratios are changed. In fact, we are use two different scenarios for dynamic and static power ratios in addition to the previous scenario in section (\ref{sec.res}). Therefore, we have three different scenarios for three different dynamic and static power ratios refer to as: 70\%-20\%, 80\%-20\% and 90\%-10\% scenario. The results of these scenarios running NAS benchmarks class C on 8 or 9 nodes are place in the tables (\ref{table:res_s1} and \ref{table:res_s2}).
+
+The results of the previous section are obtained using a percentage of 80\% for
+dynamic power and 20\% for static power of total power consumption. In this
+section we are change these ratio by using two others scenarios. Because is
+interested to measure the ability of the proposed algorithm to changes it
+behavior when these power ratios are changed. In fact, we are use two different
+scenarios for dynamic and static power ratios in addition to the previous
+scenario in section (\ref{sec.res}). Therefore, we have three different
+scenarios for three different dynamic and static power ratios refer to as:
+70\%-20\%, 80\%-20\% and 90\%-10\% scenario. The results of these scenarios
+running NAS benchmarks class C on 8 or 9 nodes are place in the tables
+(\ref{table:res_s1} and \ref{table:res_s2}).
\begin{table}[htb]
\caption{The results of 70\%-30\% powers scenario}
%%% ispell-local-dictionary: "american"
%%% End:
-% LocalWords: Fanfakh Charr FIXME Tianhe DVFS HPC NAS NPB SMPI Rauber's Rauber
-% LocalWords: CMOS EQ EPSA Franche Comté Tflop Rünger IUT Maréchal Juin cedex
+% LocalWords: Fanfakh Charr FIXME Tianhe DVFS HPC NAS NPB SMPI Rauber's Rauber
+% LocalWords: CMOS EQ EPSA Franche Comté Tflop Rünger IUT Maréchal Juin cedex
+% LocalWords: de badri muslim MPI TcpOld TcmOld dNew dOld cp Sopt Tcp Tcm Ps
+% LocalWords: Scp Fmax Fdiff SimGrid GFlops Xeon EP BT
