Rename multiply-defined labels.

[mpi-energy2.git] / Heter_paper.tex

diff --git a/Heter_paper.tex b/Heter_paper.tex
index 2a465d2000126fbcc0501a55a97a78cc527ca5b1..016cd015aff20afdb595bc5f39f87ef73a8f6644 100644 (file)
--- a/Heter_paper.tex
+++ b/Heter_paper.tex
@@ -53,15 +53,15 @@
 \newcommand{\Told}{\Xsub{T}{Old}} 
 \begin{document} 
 
 \newcommand{\Told}{\Xsub{T}{Old}} 
 \begin{document} 
 

-\title{Energy Consumption Reduction in heterogeneous architecture using DVFS}
-
-\author{%
+\title{Energy Consumption Reduction in a Heterogeneous Architecture Using DVFS}
+ 
+\author{% 

   \IEEEauthorblockN{%
     Jean-Claude Charr,
     Raphaël Couturier,
     Ahmed Fanfakh and
     Arnaud Giersch
   \IEEEauthorblockN{%
     Jean-Claude Charr,
     Raphaël Couturier,
     Ahmed Fanfakh and
     Arnaud Giersch

-  }
+  } 

   \IEEEauthorblockA{%
     FEMTO-ST Institute\\
     University of Franche-Comté\\
   \IEEEauthorblockA{%
     FEMTO-ST Institute\\
     University of Franche-Comté\\


@@ -76,27 +76,123 @@
 \maketitle
 
 \begin{abstract}
 \maketitle
 
 \begin{abstract}

-  
+Computing platforms are consuming more and more energy due to the increase of the number of nodes composing them. 
+To minimize the operating costs of these platforms many techniques have been used. Dynamic voltage and frequency 
+scaling (DVFS) is one of them, it reduces the frequency of a CPU to lower its energy consumption. However, 
+lowering the frequency of a CPU might increase the execution time of an application running on that processor. 
+Therefore, the frequency that gives the best  tradeoff between the energy consumption and the performance of an 
+application must be selected. 
+
+In this paper, a new online frequencies selecting algorithm for heterogeneous platforms is presented. 
+It selects the frequency that gives  the best tradeoff between energy saving and performance degradation, 
+for each node computing the message passing iterative application. The algorithm has a small overhead and 
+works without training or profiling. It uses a new energy model for message passing iterative applications 
+running on a heterogeneous platform. The proposed algorithm was evaluated  on the Simgrid simulator while 
+running the NAS parallel benchmarks. The experiments demonstrated that it reduces the energy consumption 
+up to 35\% while limiting the performance degradation as much as possible.

 \end{abstract}
 
 \section{Introduction}
 \label{sec.intro}
 \end{abstract}
 
 \section{Introduction}
 \label{sec.intro}

-
+The need for more computing power is continually increasing. To partially satisfy this need, most supercomputers 
+constructors just put more computing nodes in their platform. The resulting platform might achieve higher floating 
+point operations per second (FLOPS), but the energy consumption and the heat dissipation are also increased. 
+As an example, the chinese supercomputer Tianhe-2 had the highest FLOPS in November 2014 according to the Top500 
+list \cite{TOP500_Supercomputers_Sites}.  However, it was also the  most power hungry platform with its over 3 millions 
+cores consuming around 17.8 megawatts. Moreover, according to the U.S. annual energy outlook 2014 
+\cite{U.S_Annual.Energy.Outlook.2014}, the price of energy for 1 megawatt-hour 
+was approximately equal to \$70. 
+Therefore, the price of the energy consumed by the 
+Tianhe-2 platform is approximately more than \$10 millions each year. 
+The computing platforms must be more energy efficient and offer the highest number of FLOPS per watt possible, 
+such as the TSUBAME-KFC at the GSIC center of Tokyo which  
+became the top of the Green500 list in June 2014 \cite{Green500_List}. 
+This heterogeneous platform executes more than four  GFLOPS per watt.
+
+Besides hardware improvements, there are many software techniques to lower the energy consumption of these platforms, 
+such as scheduling, DVFS, ... DVFS is a widely  used process to reduce the energy consumption of a processor by lowering 
+its frequency \cite{Rizvandi_Some.Observations.on.Optimal.Frequency}. However, it also the reduces the number of FLOPS 
+executed by the processor which might increase  the execution time of the application running over that processor.
+Therefore, researchers used different optimization strategies to select the frequency that gives the best tradeoff  
+between the energy reduction and 
+performance degradation ratio. \textbf{In our previous paper \cite{Our_first_paper},  a frequency selecting algorithm 
+was proposed for distributed iterative application running over homogeneous platform. While in this paper the algorithm is  significantly adapted to run over a heterogeneous platform. This platform is a collection of heterogeneous computing nodes interconnected via a high speed homogeneous network.}
+
+The proposed frequency selecting algorithm selects the vector of frequencies for a heterogeneous platform that runs a message passing iterative application,  that gives the maximum energy reduction and minimum 
+performance degradation ratio simultaneously. The algorithm has a very small 
+overhead, works online and does not need any training or profiling.  
+
+This paper is organized as follows: Section~\ref{sec.relwork} presents some
+related works from other authors.  Section~\ref{sec.exe} describes how the
+execution time of message passing programs can be predicted.  It also presents an energy
+model that predicts the energy consumption of an application running over a heterogeneous platform. Section~\ref{sec.compet} presents
+the energy-performance objective function that maximizes the reduction of energy
+consumption while minimizing the degradation of the program's performance.
+Section~\ref{sec.optim} details the proposed frequency selecting algorithm then the precision of the proposed algorithm is verified. 
+Section~\ref{sec.expe} presents the results of applying the algorithm on  the NAS parallel benchmarks and executing them 
+on a heterogeneous platform. It also shows the results of running three 
+different power scenarios and comparing them. 
+Finally, we conclude in Section~\ref{sec.concl} with a summary and some future works.

 
 \section{Related works}
 \label{sec.relwork}
 
 \section{Related works}
 \label{sec.relwork}

+DVFS is a technique enabled 
+in modern processors to scale down both the voltage and the frequency of 
+the CPU while computing, in order to reduce the energy consumption of the processor. DVFS is 
+also  allowed in the GPUs to achieve the same goal. Reducing the frequency of a processor lowers its number of FLOPS and might degrade the performance of the application running on that processor, especially if it is compute bound. Therefore selecting the appropriate frequency for a processor to satisfy some objectives and while taking into account all the constraints, is not a trivial operation.  Many researchers used different strategies to tackle this problem. Some of them used online methods that compute the new frequency while executing the application \textbf{add a reference for an online method here}. Others used offline methods that might need to run the application and profile it before selecting the new frequency \textbf{add a reference for an offline method}. The methods could be heuristics, exact  or brute force methods that satisfy varied objectives such as energy reduction or performance. They also could be adapted to the execution's environment and the type of the application such as sequential, parallel or distributed architecture, homogeneous or heterogeneous platform,  synchronous or asynchronous application, ... 
+
+In this paper, we are interested in reducing energy for message passing iterative synchronous applications running over heterogeneous platforms.
+Some works have already been done for such platforms and it can be classified into two types of heterogeneous platforms: 
+\begin{itemize}

 
 

+\item the platform is composed of homogeneous GPUs and homogeneous CPUs.
+\item the platform is only composed of heterogeneous CPUs.

 
 

+\end{itemize}

 
 

+For the first type of platform, the compute intensive parallel tasks are executed on the  GPUs and the rest are executed 
+on the CPUs.  Luley et al.
+~\cite{Luley_Energy.efficiency.evaluation.and.benchmarking}, proposed  a heterogeneous 
+cluster composed of Intel Xeon CPUs and NVIDIA GPUs. Their main goal was to maximize the 
+energy efficiency of the platform during computation by maximizing the number of FLOPS per watt generated. 
+In~\cite{KaiMa_Holistic.Approach.to.Energy.Efficiency.in.GPU-CPU}, Kai Ma et al. developed a scheduling 
+algorithm that distributes  workloads proportional to the computing power of the nodes which could be a GPU or a CPU. All the tasks must be completed at the same time.
+In~\cite{Rong_Effects.of.DVFS.on.K20.GPU}, Rong et al. showed that 
+a heterogeneous (GPUs and CPUs) cluster that enables DVFS gave better energy and performance 
+efficiency than other clusters only composed of  CPUs.
+ 
+The work presented in this paper concerns the second type of platform,, with heterogeneous CPUs.
+Many methods were conceived to reduce the energy consumption of this type of platform.  Naveen et al.~\cite{Naveen_Power.Efficient.Resource.Scaling}  
+developed a method that minimize the value of $energy*delay^2$ by dynamically assigning new frequencies to the CPUs of the heterogeneous cluster. \textbf{should define the delay} Lizhe et al.~\cite{Lizhe_Energy.aware.parallel.task.scheduling} propose
+an algorithm that divides the executed tasks into two types: the critical and 
+non critical tasks. The algorithm scales down the frequency of  non critical tasks proportionally to their  slack and communication times while limiting  the performance degradation percentage to less than 10\%. In~\cite{Joshi_Blackbox.prediction.of.impact.of.DVFS} 
+and \cite{Spiliopoulos_Green.governors.Adaptive.DVFS},  a heterogeneous cluster composed of two  types 
+of Intel and AMD processors. The consumed energy 
+and the performance for each frequency gear were predicted, then the algorithm selected the best gear that gave 
+the best tradeoff. \textbf{what energy model they used? what method they used? }
+In~\cite{Shelepov_Scheduling.on.Heterogeneous.Multicore} and \cite{Li_Minimizing.Energy.Consumption.for.Frame.Based.Tasks}, 
+ the best frequencies for a specified heterogeneous cluster are selected offline using some 
+heuristic. Chen et al.~\cite{Chen_DVFS.under.quality.of.service.requirements} used a greedy dynamic approach to  
+minimize the power consumption of heterogeneous severs  with time/space complexity \textbf{what does it mean}. This approach 
+had considerable overhead.
+In contrast to the above described papers, this paper presents the following contributions :
+\begin{enumerate}
+\item  two new energy and performance models for message passing iterative synchronous applications running over 
+       a heterogeneous platform. Both models takes into account the communication and slack times. The models can predict the required energy and the execution time of the application.
+       
+\item a new online frequency selecting algorithm for heterogeneous platforms. The algorithm has a very small 
+      overhead and does not need for any training or profiling. It uses a new optimization function which simultaneously maximizes the performance and minimizes the energy consumption of a message passing iterative synchronous application .
+
+      
+\end{enumerate}

 
 \section{The performance and energy consumption measurements on heterogeneous architecture}
 \label{sec.exe}
 
 
 \section{The performance and energy consumption measurements on heterogeneous architecture}
 \label{sec.exe}
 

-% \JC{The whole subsection ``Parallel Tasks Execution on Homogeneous Platform'',
-%   can be deleted if we need space, we can just say we are interested in this
-%   paper in homogeneous clusters}

 
 

-\subsection{The execution time of message passing distributed iterative applications on a heterogeneous platform}
+
+\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
 
 In this paper, we are interested in reducing the energy consumption of message
 passing distributed iterative synchronous applications running over


@@ -106,27 +202,44 @@ 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.
 
 power (FLOPS), energy consumption, CPU's frequency range, \dots{} but they all
 have the same network bandwidth and latency.
 

-
-\begin{figure}[t]
+The overall execution time  of a distributed iterative synchronous application 
+over a heterogeneous platform  consists of the sum of the computation time and 
+the communication time for every iteration on a node. However, due to the 
+heterogeneous computation power of the computing nodes, slack times might occur 
+when fast nodes have to  wait, during synchronous communications, for  the slower 
+nodes to finish  their computations (see Figure~(\ref{fig:heter})). 
+Therefore,  the overall execution time  of the program is the execution time of the slowest
+task which have the highest computation time and no slack time.
+  
+ \begin{figure}[t]

   \centering
     \includegraphics[scale=0.6]{fig/commtasks}
   \caption{Parallel tasks on a heterogeneous platform}
   \label{fig:heter}
 \end{figure}
 
   \centering
     \includegraphics[scale=0.6]{fig/commtasks}
   \caption{Parallel tasks on a heterogeneous platform}
   \label{fig:heter}
 \end{figure}
 

- The  overall execution time  of a distributed iterative synchronous application over a heterogeneous platform  consists of the sum of the computation time and the communication time for every iteration on a node. However, due to the heterogeneous computation power of the computing nodes, slack times might occur when fast nodes have to
- wait, during synchronous communications, for  the slower nodes to finish  their computations (see Figure~(\ref{fig:heter})). 
- Therefore,  the overall execution time  of the program is the execution time of the slowest
- task which have the highest computation time and no slack time.
- 
-Dynamic Voltage and Frequency Scaling (DVFS) is a process, implemented in modern processors, that reduces the energy consumption
-of a CPU by scaling down its voltage and frequency.  Since DVFS lowers the frequency of a CPU and consequently its computing power, the execution time of a program running over that scaled down processor might increase, especially if the program is compute bound.  The frequency reduction process can be  expressed by the scaling factor S which is the ratio between  the maximum and the new frequency of a CPU as in EQ (\ref{eq:s}).
+Dynamic Voltage and Frequency Scaling (DVFS) is a process, implemented in 
+modern processors, that reduces the energy consumption of a CPU by scaling 
+down its voltage and frequency.  Since DVFS lowers the frequency of a CPU 
+and consequently its computing power, the execution time of a program running 
+over that scaled down processor might increase, especially if the program is 
+compute bound.  The frequency reduction process can be  expressed by the scaling 
+factor S which is the ratio between  the maximum and the new frequency of a CPU 
+as in EQ (\ref{eq:s}).

 \begin{equation}
   \label{eq:s}
  S = \frac{F_\textit{max}}{F_\textit{new}}
 \end{equation}
 \begin{equation}
   \label{eq:s}
  S = \frac{F_\textit{max}}{F_\textit{new}}
 \end{equation}

- 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.
+ 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{Freeh_Exploring.the.Energy.Time.Tradeoff}. 
+ 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
 
 Since in a heterogeneous platform, each node has different characteristics,
 especially different frequency gears, when applying DVFS operations on these


@@ -143,28 +256,60 @@ vector of scaling factors can be predicted using EQ (\ref{eq:perf}).
  \textit  T_\textit{new} = 
  \max_{i=1,2,\dots,N} ({TcpOld_{i}} \cdot S_{i}) +  MinTcm
 \end{equation}
  \textit  T_\textit{new} = 
  \max_{i=1,2,\dots,N} ({TcpOld_{i}} \cdot S_{i}) +  MinTcm
 \end{equation}

-where $TcpOld_i$ is the computation time  of processor $i$ during the first iteration and $MinTcm$ is the communication time of the slowest processor from the first iteration.  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
- communication time without any slack time. Therefore, we can consider the execution time of the iterative application is equal to the execution time of one iteration as in EQ(\ref{eq:perf}) multiplied by the number of iterations of that application.
-
-This prediction model is based on our model for predicting the execution time of message passing distributed applications for homogeneous architectures~\cite{45}. The execution time prediction model is used in our method for optimizing both energy consumption and performance of iterative methods, which is presented in the following sections.
+where $TcpOld_i$ is the computation time  of processor $i$ during the first 
+iteration and $MinTcm$ is the communication time of the slowest processor from 
+the first iteration.  The model computes the maximum computation time 
+with scaling factor from each node  added to the communication time of the \subsection{The verifications of the proposed method}
+\label{sec.verif.method}
+The precision of the proposed algorithm mainly depends on the execution time prediction model defined in 
+EQ(\ref{eq:perf}) and the energy model computed by EQ(\ref{eq:energy}). 
+The energy model is also significantly dependent  on the execution time model because the static energy is 
+linearly related the execution time and the dynamic energy is related to the computation time. So, all of 
+the work presented in this paper is based on the execution time model. To verify this model, the predicted 
+execution time was compared to  the real execution time over Simgrid for all  the NAS parallel benchmarks 
+running class B on 8 or 9 nodes. The comparison showed that the proposed execution time model is very precise, 
+the maximum normalized difference between the predicted execution time  and the real execution time is equal 
+to 0.03 for all the NAS benchmarks.
+
+Since  the proposed algorithm is not an exact method and do not test all the possible solutions (vectors of scaling factors) 
+in the search space and to prove its efficiency, it was compared on small instances to a brute force search algorithm 
+that tests all the possible solutions. The brute force algorithm was applied to different NAS benchmarks classes with 
+different number of nodes. The solutions returned by the brute force algorithm and the proposed algorithm were identical 
+and the proposed algorithm was on average 10 times faster than the 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$ 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 sections (\ref{sec.res}) and (\ref{sec.compare}).
+slowest node, it means  only the  communication time without any slack time. 
+Therefore, we can consider the execution time of the iterative application is 
+equal to the execution time of one iteration as in EQ(\ref{eq:perf}) multiplied 
+by the number of iterations of that application.
+
+This prediction model is developed from our model for predicting the execution time of 
+message passing distributed applications for homogeneous architectures~\cite{Our_first_paper}. 
+The execution time prediction model is used in our method for optimizing both 
+energy consumption and performance of iterative methods, which is presented in the 
+following sections.

 
 
 \subsection{Energy model for heterogeneous platform}
 
 
 \subsection{Energy model for heterogeneous platform}

-Many researchers~\cite{9,3,15,26} divide the power consumed by a processor into
+Many researchers~\cite{Malkowski_energy.efficient.high.performance.computing,
+Rauber_Analytical.Modeling.for.Energy,Zhuo_Energy.efficient.Dynamic.Task.Scheduling,
+Rizvandi_Some.Observations.on.Optimal.Frequency} divide the power consumed by a processor into

 two power metrics: the static and the dynamic power.  While the first one is
 consumed as long as the computing unit is turned on, the latter is only consumed during
 two power metrics: the static and the dynamic power.  While the first one is
 consumed as long as the computing unit is turned on, the latter is only consumed during

-computation times.  The dynamic power $P_{d}$ is related to the switching
+computation times.  The dynamic power $Pd$ is related to the switching

 activity $\alpha$, load capacitance $C_L$, the supply voltage $V$ and
 operational frequency $F$, as shown in EQ(\ref{eq:pd}).
 \begin{equation}
   \label{eq:pd}
 activity $\alpha$, load capacitance $C_L$, the supply voltage $V$ and
 operational frequency $F$, as shown in EQ(\ref{eq:pd}).
 \begin{equation}
   \label{eq:pd}

-  P_\textit{d} = \alpha \cdot C_L \cdot V^2 \cdot F
+  Pd = \alpha \cdot C_L \cdot V^2 \cdot F

 \end{equation}
 \end{equation}

-The static power $P_{s}$ captures the leakage power as follows:
+The static power $Ps$ captures the leakage power as follows:

 \begin{equation}
   \label{eq:ps}
 \begin{equation}
   \label{eq:ps}

-   P_\textit{s}  = V \cdot N_{trans} \cdot K_{design} \cdot I_{leak}
+   Ps  = V \cdot N_{trans} \cdot K_{design} \cdot I_{leak}

 \end{equation}
 where V is the supply voltage, $N_{trans}$ is the number of transistors,
 $K_{design}$ is a design dependent parameter and $I_{leak}$ is a
 \end{equation}
 where V is the supply voltage, $N_{trans}$ is the number of transistors,
 $K_{design}$ is a design dependent parameter and $I_{leak}$ is a


@@ -172,19 +317,18 @@ technology-dependent parameter.  The energy consumed by an individual processor
 to execute a given program can be computed as:
 \begin{equation}
   \label{eq:eind}
 to execute a given program can be computed as:
 \begin{equation}
   \label{eq:eind}

-   E_\textit{ind} =  P_\textit{d} \cdot Tcp + P_\textit{s} \cdot T
+   E_\textit{ind} =  Pd \cdot Tcp + Ps \cdot T

 \end{equation}
 \end{equation}

-where $T$ is the execution time of the program, $T_{cp}$ is the computation
-time and $T_{cp} \leq T$.  $T_{cp}$ may be equal to $T$ if there is no
+where $T$ is the execution time of the program, $Tcp$ is the computation
+time and $Tcp \leq T$.  $Tcp$ may be equal to $T$ if there is no

 communication and no slack time.
 
 communication and no slack time.
 

-The main objective of DVFS operation is to
-reduce the overall energy consumption~\cite{37}.  The operational frequency $F$
-depends linearly on the supply voltage $V$, i.e., $V = \beta \cdot F$ with some
+The main objective of DVFS operation is to reduce the overall energy consumption~\cite{Le_DVFS.Laws.of.Diminishing.Returns}.  
+The operational frequency $F$ depends linearly on the supply voltage $V$, i.e., $V = \beta \cdot F$ with some

 constant $\beta$.  This equation is used to study the change of the dynamic
 constant $\beta$.  This equation is used to study the change of the dynamic

-voltage with respect to various frequency values in~\cite{3}.  The reduction
+voltage with respect to various frequency values in~\cite{Rauber_Analytical.Modeling.for.Energy}.  The reduction

 process of the frequency can be expressed by the scaling factor $S$ which is the
 process of the frequency can be expressed by the scaling factor $S$ which is the

-ratio between the maximum and the new frequency as in EQ~(\ref{eq:s}).
+ratio between the maximum and the new frequency as in EQ(\ref{eq:s}).

 The CPU governors are power schemes supplied by the operating
 system's kernel to lower a core's frequency. we can calculate the new frequency 
 $F_{new}$ from EQ(\ref{eq:s}) as follow:
 The CPU governors are power schemes supplied by the operating
 system's kernel to lower a core's frequency. we can calculate the new frequency 
 $F_{new}$ from EQ(\ref{eq:s}) as follow:


@@ -192,32 +336,52 @@ $F_{new}$ from EQ(\ref{eq:s}) as follow:
   \label{eq:fnew}
    F_\textit{new} = S^{-1} \cdot F_\textit{max}
 \end{equation}
   \label{eq:fnew}
    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:
+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_{max} \cdot S^{-3} = P_{dOld} \cdot S^{-3}
 \end{multline}
 \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_{max} \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.
+where $ {P}_\textit{dNew}$  and $P_{dOld}$ are the  dynamic power consumed with the 
+new frequency and the maximum frequency respectively.

 
 According to EQ(\ref{eq:pdnew}) the dynamic power is reduced by a factor of $S^{-3}$ when 
 
 According to EQ(\ref{eq:pdnew}) the dynamic power is reduced by a factor of $S^{-3}$ when 

-reducing the frequency by a factor of $S$~\cite{3}. Since the FLOPS of a CPU is proportional to the frequency of a CPU, the computation time is increased proportionally to $S$.  The new dynamic energy is the  dynamic power multiplied by the new time of computation and is given by the following equation:
+reducing the frequency by a factor of $S$~\cite{Rauber_Analytical.Modeling.for.Energy}. Since the FLOPS of a CPU is proportional 
+to the frequency of a CPU, the computation time is increased proportionally to $S$.  
+The new dynamic energy is the  dynamic power multiplied by the new time of computation 
+and is given by the following equation:

 \begin{equation}
   \label{eq:Edyn}
    E_\textit{dNew} = P_{dOld} \cdot S^{-3} \cdot (Tcp \cdot S)= S^{-2}\cdot P_{dOld} \cdot  Tcp 
 \end{equation}
 \begin{equation}
   \label{eq:Edyn}
    E_\textit{dNew} = P_{dOld} \cdot S^{-3} \cdot (Tcp \cdot S)= S^{-2}\cdot P_{dOld} \cdot  Tcp 
 \end{equation}

-The static power is related to the power leakage of the CPU and is consumed during computation and even when idle. As in~\cite{3,46}, we assume that the static power of a processor is constant during idle and computation periods, and for all its available frequencies. 
-The static energy is the static power multiplied by the execution time of the program. According to the execution time model in EQ(\ref{eq:perf}), 
-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: 
+The static power is related to the power leakage of the CPU and is consumed during computation 
+and even when idle. As in~\cite{Rauber_Analytical.Modeling.for.Energy,Zhuo_Energy.efficient.Dynamic.Task.Scheduling}, 
+we assume that the static power of a processor is constant 
+during idle and computation periods, and for all its available frequencies. 
+The static energy is the static power multiplied by the execution time of the program. 
+According to the execution time model in EQ(\ref{eq:perf}), 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}
 \begin{equation}
   \label{eq:Estatic}

- E_\textit{s} = P_\textit{s} \cdot (Tcp \cdot S  + Tcm)
+ E_\textit{s} = Ps \cdot (Tcp \cdot S  + Tcm)

 \end{equation}
 
 \end{equation}
 

-In the considered heterogeneous platform, each processor $i$ might have different dynamic and static powers, noted as $Pd_{i}$ and $Ps_{i}$ respectively. Therefore, even if the distributed message passing iterative application is load balanced, the computation time of each CPU $i$ noted $Tcp_{i}$ 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 $Tcm_{i}$ 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 during one iteration is the summation of all dynamic and static energies for each  processor.  It is computed as follows:
+In the considered heterogeneous platform, each processor $i$ might have different dynamic and 
+static powers, noted as $Pd_{i}$ and $Ps_{i}$ respectively. Therefore, even if the distributed 
+message passing iterative application is load balanced, the computation time of each CPU $i$ 
+noted $Tcp_{i}$ 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 $Tcm_{i}$ 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 during one iteration 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 Pd_{i} \cdot  Tcp_i)} + {} \\
 \begin{multline}
   \label{eq:energy}
  E = \sum_{i=1}^{N} {(S_i^{-2} \cdot Pd_{i} \cdot  Tcp_i)} + {} \\


@@ -228,25 +392,40 @@ In the considered heterogeneous platform, each processor $i$ might have differen
 Reducing 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
 Reducing 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}. We can measure the overall energy consumption for the iterative 
-application by measuring  the energy consumption for one iteration as in EQ(\ref{eq:energy}) multiplied by 
-the number of iterations of that application.
+increased~\cite{Kim_Leakage.Current.Moore.Law}. We can measure the overall energy consumption for the iterative 
+application by measuring  the energy consumption for one iteration as in EQ(\ref{eq:energy}) 
+multiplied by the number of iterations of that application.

 
 
 \section{Optimization of both energy consumption and performance}
 \label{sec.compet}
 
 
 
 \section{Optimization of both energy consumption and performance}
 \label{sec.compet}
 

-Using the lowest frequency for each processor does not necessarily gives the most energy efficient execution of an application. Indeed, even though the dynamic power is reduced while scaling down the frequency of a processor, its computation power is proportionally decreased and thus the execution time might be drastically increased during which dynamic and static powers are being consumed. Therefore,  it might cancel any gains achieved by scaling down the frequency of all nodes to the minimum  and the overall energy consumption of the application might not be the optimal one. It is not trivial to select the appropriate frequency scaling factor for each processor while considering the characteristics of each processor (computation power, range of frequencies, dynamic and static powers) and the task executed (computation/communication ratio) in order to reduce the overall energy consumption and not significantly increase the execution time. In our previous work~\cite{45}, we  proposed a method that selects the optimal 
-frequency scaling factor for a homogeneous cluster executing a message passing iterative synchronous application while giving the best trade-off
- between the energy consumption and the performance for such applications. In this work we are interested in 
-heterogeneous clusters as described above. Due to the heterogeneity of the processors, not one but a  vector of scaling factors should be selected and it must  give the best trade-off between energy consumption and performance. 
-
-The relation between the energy consumption and the execution
-time for an application is complex and nonlinear, Thus, unlike the relation between the execution time 
+Using the lowest frequency for each processor does not necessarily gives the most energy 
+efficient execution of an application. Indeed, even though the dynamic power is reduced 
+while scaling down the frequency of a processor, its computation power is proportionally 
+decreased and thus the execution time might be drastically increased during which dynamic 
+and static powers are being consumed. Therefore,  it might cancel any gains achieved by 
+scaling down the frequency of all nodes to the minimum  and the overall energy consumption 
+of the application might not be the optimal one. It is not trivial to select the appropriate 
+frequency scaling factor for each processor while considering the characteristics of each processor 
+(computation power, range of frequencies, dynamic and static powers) and the task executed 
+(computation/communication ratio) in order to reduce the overall energy consumption and not 
+significantly increase the execution time. In our previous work~\cite{Our_first_paper}, we  proposed a method 
+that selects the optimal frequency scaling factor for a homogeneous cluster executing a message 
+passing iterative synchronous application while giving the best trade-off  between the energy 
+consumption and the performance for such applications. In this work we are interested in 
+heterogeneous clusters as described above. Due to the heterogeneity of the processors, not 
+one but a  vector of scaling factors should be selected and it must  give the best trade-off 
+between energy consumption and performance. 
+
+The relation between the energy consumption and the execution time for an application is 
+complex and nonlinear, Thus, unlike the relation between the execution time 

 and the scaling factor, the relation of the energy with the frequency scaling
 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 computing the ratio between the new execution time (after scaling down the frequencies of some processors) and the initial one (with maximum frequency for all nodes,) as follows:
+factors is nonlinear, for more details refer to~\cite{Freeh_Exploring.the.Energy.Time.Tradeoff}.  
+Moreover, they are not measured using the same metric.  To solve this problem, we normalize the
+execution time by computing the ratio between the new execution time (after 
+scaling down the frequencies of some processors) and the initial one (with maximum 
+frequency for all nodes,) as follows:

 \begin{multline}
   \label{eq:pnorm}
   P_\textit{Norm} = \frac{T_\textit{New}}{T_\textit{Old}}\\
 \begin{multline}
   \label{eq:pnorm}
   P_\textit{Norm} = \frac{T_\textit{New}}{T_\textit{Old}}\\


@@ -255,33 +434,30 @@ execution time by computing the ratio between the new execution time (after scal
 \end{multline}
 
 
 \end{multline}
 
 

-In the same way, we normalize the energy by computing the ratio between the consumed energy while scaling down the frequency and the consumed energy with maximum frequency for all nodes:
+In the same way, we normalize the energy by computing the ratio between the consumed energy 
+while scaling down the frequency and the consumed energy with maximum frequency for all nodes:

 \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)} +
  \sum_{i=1}^{N} {(Ps_i \cdot T_{New})}}{\sum_{i=1}^{N}{( Pd_i \cdot  Tcp_i)} +
 \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)} +
  \sum_{i=1}^{N} {(Ps_i \cdot T_{New})}}{\sum_{i=1}^{N}{( Pd_i \cdot  Tcp_i)} +

- \sum_{i=1}^{N} {(Ps_i@+eYd162 \cdot T_{Old})}}
+ \sum_{i=1}^{N} {(Ps_i \cdot T_{Old})}}

 \end{multline} 
 Where $T_{New}$ and $T_{Old}$ are computed as in EQ(\ref{eq:pnorm}).
 
  While the main 
 \end{multline} 
 Where $T_{New}$ and $T_{Old}$ are computed as in EQ(\ref{eq:pnorm}).
 
  While the main 

-goal is to optimize the energy and execution time at the same time, the normalized energy and execution time curves are not in the same direction. According 
+goal is to optimize the energy and execution time at the same time, the normalized 
+energy and execution time curves are not in the same direction. According 

 to the equations~(\ref{eq:enorm}) and~(\ref{eq:pnorm}), the vector  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.  
 
 to the equations~(\ref{eq:enorm}) and~(\ref{eq:pnorm}), the vector  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
-in~\cite{19,42}, their methods add big overheads to the algorithm to select the
-suitable frequency.  In this paper we  present a method to find the optimal
-set of frequency scaling factors to simultaneously optimize both energy and execution time
- without adding a big overhead. \textbf{put the last two phrases in the related work section}

  
   
  
   

-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 which gives 
-the normalized performance equation, as follows:
+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 which gives the normalized performance equation, as follows:

 \begin{multline}
   \label{eq:pnorm_inv}
   P_\textit{Norm} = \frac{T_\textit{Old}}{T_\textit{New}}\\
 \begin{multline}
   \label{eq:pnorm_inv}
   P_\textit{Norm} = \frac{T_\textit{Old}}{T_\textit{New}}\\


@@ -305,7 +481,7 @@ Then, we can model our objective function as finding the maximum distance
 between the energy curve EQ~(\ref{eq:enorm}) and the  performance
 curve EQ~(\ref{eq:pnorm_inv}) over all available sets of scaling factors.  This
 represents the minimum energy consumption with minimum execution time (maximum 
 between the energy curve EQ~(\ref{eq:enorm}) and the  performance
 curve EQ~(\ref{eq:pnorm_inv}) over all available sets of scaling factors.  This
 represents the minimum energy consumption with minimum execution time (maximum 

-performance) at the same time, see figure~(\ref{fig:r1}) or figure~(\ref{fig:r2}) .  Then our objective
+performance) at the same time, see figure~(\ref{fig:r1}) or figure~(\ref{fig:r2}). Then our objective

 function has the following form:
 \begin{equation}
   \label{eq:max}
 function has the following form:
 \begin{equation}
   \label{eq:max}


@@ -315,31 +491,77 @@ function has the following form:
        \overbrace{E_\textit{Norm}(S_{ij})}^{\text{Minimize}} )
 \end{equation}
 where $N$ is the number of nodes and $F$ is the  number of available frequencies for each nodes. 
        \overbrace{E_\textit{Norm}(S_{ij})}^{\text{Minimize}} )
 \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 any power values for each node (static and dynamic powers).
-However, the most energy reduction gain can be achieved when the energy curve has a convex form as shown in~\cite{15,3,19}.
+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 any power values for each node 
+(static and dynamic powers). However, the most energy reduction gain can be achieved when 
+the energy curve has a convex form as shown in~\cite{Zhuo_Energy.efficient.Dynamic.Task.Scheduling,Rauber_Analytical.Modeling.for.Energy,Hao_Learning.based.DVFS}.

 
 \section{The scaling factors selection algorithm for heterogeneous platforms }
 \label{sec.optim}
 
 
 \section{The scaling factors selection algorithm for heterogeneous platforms }
 \label{sec.optim}
 

-In this section we  propose algorithm~(\ref{HSA}) which selects the frequency scaling factors vector that gives the best trade-off between minimizing the energy consumption  and maximizing the performance of a message passing synchronous iterative application executed on a heterogeneous platform.  
-It works online during the execution time of the iterative message passing program.  It uses information gathered during the first iteration such as the computation time and the communication time in one iteration for each node. The algorithm is executed  after the first iteration and returns a vector of optimal frequency scaling factors   that satisfies the objective function EQ(\ref{eq:max}). The program apply DVFS operations to change the frequencies of the CPUs according to the computed scaling factors.  This algorithm is called just once during the execution of the program. Algorithm~(\ref{dvfs}) shows where and when the proposed scaling algorithm is called in the iterative MPI program.
-
-
-The nodes in a heterogeneous platform have different computing powers, thus while executing message passing iterative synchronous applications, fast nodes have to wait for the slower ones to finish their computations before being able to synchronously communicate with them as in figure (\ref{fig:heter}). These periods are called idle or slack times.
-Our algorithm takes into account this problem and tries to reduce these slack times when selecting the frequency scaling factors vector. At first, it selects initial frequency scaling factors that increase the execution times of fast nodes and  minimize the  differences between  the  computation times of fast and slow nodes. The value of the initial frequency scaling factor  for each node is inversely proportional to its computation time that was gathered from the first iteration. These initial frequency scaling factors are computed as   a ratio between the computation time of the slowest node and the computation time of the node $i$ as follows:
+\subsection{The algorithm details}
+In this section we  propose algorithm~(\ref{HSA}) which selects the frequency scaling factors 
+vector that gives the best trade-off between minimizing the energy consumption  and maximizing 
+the performance of a message passing synchronous iterative application executed on a heterogeneous 
+platform. It works online during the execution time of the iterative message passing program.  
+It uses information gathered during the first iteration such as the computation time and the 
+communication time in one iteration for each node. The algorithm is executed  after the first 
+iteration and returns a vector of optimal frequency scaling factors   that satisfies the objective 
+function EQ(\ref{eq:max}). The program apply DVFS operations to change the frequencies of the CPUs 
+according to the computed scaling factors.  This algorithm is called just once during the execution 
+of the program. Algorithm~(\ref{dvfs}) shows where and when the proposed scaling algorithm is called 
+in the iterative MPI program.
+
+The nodes in a heterogeneous platform have different computing powers, thus while executing message 
+passing iterative synchronous applications, fast nodes have to wait for the slower ones to finish their 
+computations before being able to synchronously communicate with them as in figure (\ref{fig:heter}). 
+These periods are called idle or slack times. 
+Our algorithm takes into account this problem and tries to reduce these slack times when selecting the 
+frequency scaling factors vector. At first, it selects initial frequency scaling factors that increase 
+the execution times of fast nodes and  minimize the  differences between  the  computation times of 
+fast and slow nodes. The value of the initial frequency scaling factor  for each node is inversely 
+proportional to its computation time that was gathered from the first iteration. These initial frequency 
+scaling factors are computed as   a ratio between the computation time of the slowest node and the 
+computation time of the node $i$ as follows:

 \begin{equation}
   \label{eq:Scp}
  Scp_{i} = \frac{\max_{i=1,2,\dots,N}(Tcp_i)}{Tcp_i}
 \end{equation}
 \begin{equation}
   \label{eq:Scp}
  Scp_{i} = \frac{\max_{i=1,2,\dots,N}(Tcp_i)}{Tcp_i}
 \end{equation}

-Using the initial  frequency scaling factors computed in EQ(\ref{eq:Scp}), the algorithm computes the initial frequencies for all nodes as a ratio between the 
-maximum frequency of node $i$  and the computation scaling factor $Scp_i$ as follows:
+Using the initial  frequency scaling factors computed in EQ(\ref{eq:Scp}), the algorithm computes 
+the initial frequencies for all nodes as a ratio between the maximum frequency of node $i$  
+and the computation scaling factor $Scp_i$ as follows:

 \begin{equation}
   \label{eq:Fint}
  F_{i} = \frac{Fmax_i}{Scp_i},~{i=1,2,\cdots,N}
 \end{equation}
 \begin{equation}
   \label{eq:Fint}
  F_{i} = \frac{Fmax_i}{Scp_i},~{i=1,2,\cdots,N}
 \end{equation}

-If the computed initial frequency for a node is not available in the gears of that node, the computed initial frequency is replaced by the nearest available frequency.
-In  figure (\ref{fig:st_freq}), the nodes are  sorted by their computing powers in ascending order and the frequencies of the faster nodes are scaled down according to the computed initial frequency scaling factors. The resulting new frequencies are coloured in blue in  figure (\ref{fig:st_freq}). This set of frequencies can be considered as a higher bound for the search space of the optimal vector of frequencies because selecting frequency scaling factors higher than the higher bound will not improve the performance of the application and it will increase its overall energy consumption. Therefore the frequency selecting factors algorithm starts its search method from these initial frequencies and takes a downward search direction. If the algorithm starts to search from the first frequencies of all nodes, regardless the higher bound frequencies, at each step the predicted performance and energy  are degreased  together, then the best distance be unreachable. This case is similar to homogeneous scaling algorithm when all nodes in the cluster has the same computing power, therefore there is a smaller distance between the performance and the energy curves, while in a heterogeneous cluster the distance is bigger and the energy saving against smaller execution time is higher, as an example see figure~(\ref{fig:r1} and \ref{fig:r2}). The algorithm iterates on all left frequencies, from the higher bound until all nodes reach their minimum frequencies, to compute their overall energy consumption and performance, and select the optimal frequency scaling factors vector. At each iteration the algorithm determines the slowest node according to EQ(\ref{eq:perf}) and keeps its frequency unchanged, while it lowers the frequency of  all other nodes by one gear. The new overall energy consumption and execution time are computed according to the new scaling factors. The optimal set of frequency scaling factors is the set that gives the highest distance according to  the objective function EQ(\ref{eq:max}).
+If the computed initial frequency for a node is not available in the gears of that node, the computed 
+initial frequency is replaced by the nearest available frequency. In  figure (\ref{fig:st_freq}), 
+the nodes are  sorted by their computing powers in ascending order and the frequencies of the faster 
+nodes are scaled down according to the computed initial frequency scaling factors. The resulting new 
+frequencies are colored in blue in  figure (\ref{fig:st_freq}). This set of frequencies can be considered 
+as a higher bound for the search space of the optimal vector of frequencies because selecting frequency 
+scaling factors higher than the higher bound will not improve the performance of the application and 
+it will increase its overall energy consumption. Therefore the algorithm that selects the frequency 
+scaling factors starts the search method from these initial frequencies and takes a downward search direction 
+toward lower frequencies. The algorithm iterates on all left frequencies, from the higher bound until all 
+nodes reach their minimum frequencies, to compute their overall energy consumption and performance, and select 
+the optimal frequency scaling factors vector. At each iteration the algorithm determines the slowest node 
+according to EQ(\ref{eq:perf}) and keeps its frequency unchanged, while it lowers the frequency of  
+all other nodes by one gear.
+The new overall energy consumption and execution time are computed according to the new scaling factors. 
+The optimal set of frequency scaling factors is the set that gives the highest distance according to  the objective 
+function EQ(\ref{eq:max}).
+
+The plots~(\ref{fig:r1} and \ref{fig:r2}) illustrate the normalized performance and consumed energy for an 
+application running on a homogeneous platform and a heterogeneous platform respectively while increasing the 
+scaling factors. It can be noticed that in a homogeneous platform the search for the optimal scaling factor 
+should be started from the maximum frequency because the performance and the consumed energy is decreased since  
+the beginning of the plot. On the other hand, in  the heterogeneous platform the performance is  maintained at 
+the beginning of the plot even if the frequencies of the faster nodes are decreased until the scaled down nodes 
+have computing powers lower than the slowest node. In other words, until they reach the higher bound. It can 
+also be noticed that the higher the difference between the faster nodes and the slower nodes is, the bigger 
+the maximum distance between the energy curve and the performance curve is while varying the scaling factors 
+which results in bigger energy savings. 

 \begin{figure}[t]
   \centering
     \includegraphics[scale=0.5]{fig/start_freq}
 \begin{figure}[t]
   \centering
     \includegraphics[scale=0.5]{fig/start_freq}


@@ -350,7 +572,6 @@ In  figure (\ref{fig:st_freq}), the nodes are  sorted by their computing powers
 
 
 
 
 
 

-

 \begin{algorithm}
   \begin{algorithmic}[1]
     % \footnotesize
 \begin{algorithm}
   \begin{algorithmic}[1]
     % \footnotesize


@@ -416,13 +637,48 @@ In  figure (\ref{fig:st_freq}), the nodes are  sorted by their computing powers
   \label{dvfs}
 \end{algorithm}
 
   \label{dvfs}
 \end{algorithm}
 

+\subsection{The verifications of the proposed algorithm}
+\label{sec.verif.algo}
+The precision of the proposed algorithm mainly depends on the execution time prediction model defined in 
+EQ(\ref{eq:perf}) and the energy model computed by EQ(\ref{eq:energy}). 
+The energy model is also significantly dependent  on the execution time model because the static energy is 
+linearly related the execution time and the dynamic energy is related to the computation time. So, all of 
+the work presented in this paper is based on the execution time model. To verify this model, the predicted 
+execution time was compared to  the real execution time over SimGrid/SMPI simulator, v3.10~\cite{casanova+giersch+legrand+al.2014.versatile}, 
+for all  the NAS parallel benchmarks NPB v3.3 
+\cite{NAS.Parallel.Benchmarks}, running class B on 8 or 9 nodes. The comparison showed that the proposed execution time model is very precise, 
+the maximum normalized difference between the predicted execution time  and the real execution time is equal 
+to 0.03 for all the NAS benchmarks.
+
+Since  the proposed algorithm is not an exact method and do not test all the possible solutions (vectors of scaling factors) 
+in the search space and to prove its efficiency, it was compared on small instances to a brute force search algorithm 
+that tests all the possible solutions. The brute force algorithm was applied to different NAS benchmarks classes with 
+different number of nodes. The solutions returned by the brute force algorithm and the proposed algorithm were identical 
+and the proposed algorithm was on average 10 times faster than the 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$ 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.
+

 \section{Experimental results}
 \label{sec.expe}
 \section{Experimental results}
 \label{sec.expe}

-To evaluate the efficiency and the overall energy consumption reduction of algorithm~\ref{HSA}), it was applied to the NAS parallel benchmarks NPB v3.3 
-\cite{44}. The experiments were executed on the simulator SimGrid/SMPI
-v3.10~\cite{casanova+giersch+legrand+al.2014.versatile} which offers easy tools to create a heterogeneous platform and run message passing applications over it. The heterogeneous platform that was used in the experiments, had one core per node because just one process was executed per node. The heterogeneous platform  was composed of four types of nodes. Each type of nodes had different characteristics such as the maximum CPU frequency, the number of
-available frequencies and the computational power, see table
-(\ref{table:platform}). The characteristics of these different types of  nodes are inspired   from the specifications of real Intel processors. The heterogeneous platform had up to 144 nodes and had nodes from the four types in equal proportions, for example if  a benchmark was executed on 8 nodes, 2 nodes from each type were used. Since the constructors of CPUs do not specify the dynamic and the static power of their CPUs, for each type of node they were chosen proportionally to  its computing power (FLOPS).  In the initial heterogeneous platform,  while computing with highest frequency, each node  consumed power proportional to its computing power which 80\% of it was dynamic power and the rest was 20\% was static power, the same assumption  was made in \cite{45,3}. Finally, These nodes were connected via an ethernet network with 1 Gbit/s bandwidth.
+To evaluate the efficiency and the overall energy consumption reduction of algorithm~(\ref{HSA}), 
+it was applied to the NAS parallel benchmarks NPB v3.3. The experiments were executed 
+on the simulator SimGrid/SMPI which offers easy tools to create a heterogeneous platform and run 
+message passing applications over it. The  heterogeneous platform that was used in the experiments, 
+had one core per node because just one  process was executed per node. 
+The heterogeneous platform  was composed of four types of nodes. Each type of nodes had different 
+characteristics such as the maximum CPU frequency, the number of
+available frequencies and the computational power, see table (\ref{table:platform}). The characteristics 
+of these different types of  nodes are inspired   from the specifications of real Intel processors. 
+The heterogeneous platform had up to 144 nodes and had nodes from the four types in equal proportions, 
+for example if  a benchmark was executed on 8 nodes, 2 nodes from each type were used. Since the constructors 
+of CPUs do not specify the dynamic and the static power of their CPUs, for each type of node they were 
+chosen proportionally to its computing power (FLOPS).  In the initial heterogeneous platform,  while computing 
+with highest frequency, each node  consumed power proportional to its computing power which 80\% of it was 
+dynamic power and the rest was 20\% for the static power, the same assumption  was made in \cite{Our_first_paper,Rauber_Analytical.Modeling.for.Energy}. 
+Finally, These nodes were connected via an ethernet network with 1 Gbit/s bandwidth.

 
 
 \begin{table}[htb]
 
 
 \begin{table}[htb]


@@ -459,7 +715,12 @@ available frequencies and the computational power, see table
 \label{sec.res}
 
 
 \label{sec.res}
 
 

-The proposed algorithm was applied to the seven parallel NAS benchmarks (EP, CG, MG, FT, BT, LU and SP) and the benchmarks were executed with the three classes: A,B and C. However, due to the lack of space in this paper, only the results of the biggest class, C, are presented while being run on different number of nodes, ranging  from 4 to 128 or 144 nodes depending on the benchmark being executed. Indeed, the benchmarks CG, MG, LU, EP and FT should be executed on $1, 2, 4, 8, 16, 32, 64, 128$ nodes. The other benchmarks such as BT and SP should be executed on $1, 4, 9, 16, 36, 64, 144$ nodes.
+The proposed algorithm was applied to the seven parallel NAS benchmarks (EP, CG, MG, FT, BT, LU and SP) 
+and the benchmarks were executed with the three classes: A,B and C. However, due to the lack of space in 
+this paper, only the results of the biggest class, C, are presented while being run on different number 
+of nodes, ranging  from 4 to 128 or 144 nodes depending on the benchmark being executed. Indeed, the 
+benchmarks CG, MG, LU, EP and FT should be executed on $1, 2, 4, 8, 16, 32, 64, 128$ nodes. 
+The other benchmarks such as BT and SP should be executed on $1, 4, 9, 16, 36, 64, 144$ nodes.

 
  
  
 
  
  


@@ -625,51 +886,99 @@ The proposed algorithm was applied to the seven parallel NAS benchmarks (EP, CG,
   \end{tabular}
   \label{table:res_128n}
 \end{table}
   \end{tabular}
   \label{table:res_128n}
 \end{table}

-The overall energy consumption was computed for each instance according to the energy consumption  model EQ(\ref{eq:energy}), with and without applying the algorithm. The execution time was also measured for all these experiments. Then, the energy saving and performance degradation percentages were computed for each instance.  
-The results are presented in tables (\ref{table:res_4n}, \ref{table:res_8n}, \ref{table:res_16n}, \ref{table:res_32n}, \ref{table:res_64n} and \ref{table:res_128n}). All these results are the average values from many experiments for  energy savings and performance degradation.
-
-The tables  show the experimental results for running the NAS parallel benchmarks on different number of nodes. The experiments show that the algorithm reduce significantly the energy consumption (up to 35\%) and tries to limit the performance degradation. They also show that the  energy saving percentage is decreased  when the number of the computing nodes is increased. This reduction is due to the increase of the communication times compared to the execution times when the benchmarks are run over a high number of nodes. Indeed, the benchmarks with the same class, C, are executed on different number of nodes, so the computation required for each iteration is divided by the number of computing nodes.   On the other hand, more communications are required when increasing the number of nodes so the static energy is increased linearly according to the communication time and the dynamic power is less relevant in the overall energy consumption. Therefore, reducing the frequency with algorithm~\ref{HSA}) have less effect in reducing the overall energy savings. It can also be noticed that for the benchmarks EP and SP that contain little or no communications,  the energy savings are not significantly affected with the high number of nodes. No experiments were conducted using bigger classes such as D, because they require a lot of memory(more than 64GB) when being executed by the simulator on one machine.
-The maximum distance between the normalized energy curve and the normalized performance for each instance is also shown in the result tables. It is decreased in the same way as the energy saving percentage. The tables also show that the performance degradation percentage is not significantly increased when the number of computing nodes is increased because the computation times are small when compared to the communication times.  
+The overall energy consumption was computed for each instance according to the energy 
+consumption  model EQ(\ref{eq:energy}), with and without applying the algorithm. The 
+execution time was also measured for all these experiments. Then, the energy saving 
+and performance degradation percentages were computed for each instance.  
+The results are presented in tables (\ref{table:res_4n}, \ref{table:res_8n}, \ref{table:res_16n}, 
+\ref{table:res_32n}, \ref{table:res_64n} and \ref{table:res_128n}). All these results are the 
+average values from many experiments for  energy savings and performance degradation.
+
+The tables  show the experimental results for running the NAS parallel benchmarks on different 
+number of nodes. The experiments show that the algorithm reduce significantly the energy 
+consumption (up to 35\%) and tries to limit the performance degradation. They also show that 
+the  energy saving percentage is decreased  when the number of the computing nodes is increased. 
+This reduction is due to the increase of the communication times compared to the execution times 
+when the benchmarks are run over a high number of nodes. Indeed, the benchmarks with the same class, C, 
+are executed on different number of nodes, so the computation required for each iteration is divided 
+by the number of computing nodes.   On the other hand, more communications are required when increasing 
+the number of nodes so the static energy is increased linearly according to the communication time and 
+the dynamic power is less relevant in the overall energy consumption. Therefore, reducing the frequency 
+with algorithm~(\ref{HSA}) have less effect in reducing the overall energy savings. It can also be 
+noticed that for the benchmarks EP and SP that contain little or no communications,  the energy savings 
+are not significantly affected with the high number of nodes. No experiments were conducted using bigger 
+classes such as D, because they require a lot of memory(more than 64GB) when being executed by the simulator 
+on one machine. The maximum distance between the normalized energy curve and the normalized performance 
+for each instance is also shown in the result tables. It is decreased in the same way as the energy 
+saving percentage. The tables also show that the performance degradation percentage is not significantly 
+increased when the number of computing nodes is increased because the computation times are small when 
+compared to the communication times.  

 
 
  
 \begin{figure}
   \centering
 
 
  
 \begin{figure}
   \centering

-  \subfloat[CG, MG, LU and FT benchmarks]{%
-    \includegraphics[width=.23185\textwidth]{fig/avg_eq}\label{fig:avg_eq}}%
+  \subfloat[Energy saving]{%
+    \includegraphics[width=.2315\textwidth]{fig/energy}\label{fig:energy}}%

   \quad%
   \quad%

-  \subfloat[BT and SP benchmarks]{%
-    \includegraphics[width=.23185\textwidth]{fig/avg_neq}\label{fig:avg_neq}}
+  \subfloat[Performance degradation ]{%
+    \includegraphics[width=.2315\textwidth]{fig/per_deg}\label{fig:per_deg}}

   \label{fig:avg}
   \label{fig:avg}

-  \caption{The average of energy and performance for all NAS benchmarks running with difference number of nodes}
+  \caption{The energy and performance for all NAS benchmarks running with difference number of nodes}

 \end{figure}
 
 \end{figure}
 

- 
-   The average of values 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 because the communication times is increased as mentioned
-before. Thus, the average of distances (our objective function) is decreased
-linearly with energy saving while keeping the average of performance degradation approximately is 
-the same. In BT and SP benchmarks, the average of the  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
-benchmark such as the computations to communications ratio that has.
-
-\textbf{All the previous paragraph should be deleted, we need to talk about it}
+Plots (\ref{fig:energy} and \ref{fig:per_deg}) present the energy saving and performance degradation 
+respectively for all the benchmarks according to the number of used nodes. As shown in the first plot, 
+the energy saving percentages of the benchmarks MG, LU, BT and FT are decreased linearly  when the the 
+number of nodes is increased. While for the  EP and SP benchmarks, the energy saving percentage is not 
+affected by the increase of the number of computing nodes, because in these benchmarks there are little or 
+no communications. Finally, the energy saving of the GC benchmark  is significantly decreased when the number 
+of nodes is increased because  this benchmark has more communications than the others. The second plot 
+shows that the performance degradation percentages of most of the benchmarks are decreased when they 
+run on a big number of nodes because they spend more time communicating than computing, thus, scaling 
+down the frequencies of some nodes have less effect on the performance. 
+
+
+
+

 \subsection{The results for different power consumption scenarios}
 \subsection{The results for different power consumption scenarios}

+\label{sec.compare}
+The results of the previous section were obtained while using processors that consume during computation 
+an overall power which is 80\% composed of  dynamic power and 20\% of static power. In this section, 
+these ratios are changed and two new power scenarios are considered in order to evaluate how the proposed  
+algorithm adapts itself according to the static and dynamic power values.  The two new power scenarios 
+are the following: 

 
 

-The results of the previous section were obtained while using processors that consume during computation an overall power which is 80\% composed of  dynamic power and 20\% of static power. In this
-section, these ratios are changed and two new power scenarios are considered in order to evaluate how the proposed  algorithm adapts itself according to the static and dynamic power values.  The two new power scenarios are the following: 

 \begin{itemize}
 \item 70\% dynamic power  and 30\% static power
 \item 90\% dynamic power  and 10\% static power
 \end{itemize}
 \begin{itemize}
 \item 70\% dynamic power  and 30\% static power
 \item 90\% dynamic power  and 10\% static power
 \end{itemize}

-The NAS parallel benchmarks were executed again over processors that follow the the new power scenarios. The class C of each benchmark was run over 8 or 9 nodes and the results are presented in  tables (\ref{table:res_s1} and \ref{table:res_s2}). \textbf{These tables show that the energy saving percentage of the 70\%-30\% scenario is less for all benchmarks compared to the energy saving of the 90\%-10\% scenario, because this scenario uses higher percentage of dynamic dynamic power that is quadratically related to scaling factors. While the performance degradation percentage is less in 70\%-30\% scenario  compared to 90\%-10\%  scenario, because the first scenario used higher percentage for static power consumption that is linearly related to scaling factors and thus the execution time. }

 
 

-The two new power scenarios are compared to the old one  in figure (\ref{fig:sen_comp}). It shows the average of the performance degradation, the energy saving and the distances for all NAS benchmarks of class C running on 8 or 9 nodes. The comparison shows that  the energy saving ratio is proportional to the dynamic power ratio: it is increased when applying the  90\%-10\% scenario because at maximum frequency the dynamic  energy is the the most relevant in the overall consumed energy and can be reduced by lowering the frequency of some processors. On the other hand, the energy saving is decreased when  the 70\%-30\% scenario is used because the dynamic  energy is less relevant in the overall consumed energy and lowering the frequency do not returns big energy savings.
-Moreover, the average of the performance degradation is decreased when using a higher ratio for static power (e.g. 70\%-30\% scenario and 80\%-20\% scenario). Since the proposed algorithm optimizes the energy consumption when using a higher ratio for dynamic power the algorithm selects bigger frequency scaling factors that result in more energy saving but less performance, for example see the figure (\ref{fig:scales_comp}). The opposite happens when using a higher ratio for  static  power, the algorithm proportionally  selects  smaller scaling values which results in less energy saving but less performance degradation. 
+The NAS parallel benchmarks were executed again over processors that follow the the new power scenarios. 
+The class C of each benchmark was run over 8 or 9 nodes and the results are presented in  tables 
+(\ref{table:res_s1} and \ref{table:res_s2}). These tables show that the energy saving percentage of the 70\%-30\% 
+scenario is less for all benchmarks compared to the energy saving of the 90\%-10\% scenario. Indeed, in the latter 
+more dynamic power is consumed when nodes are running on their maximum frequencies, thus, scaling down the frequency 
+of the nodes results in higher energy savings than in the 70\%-30\% scenario. On the other hand,  the performance 
+degradation percentage is less in the 70\%-30\% scenario  compared to the 90\%-10\%  scenario. This is due to the 
+higher static power percentage in the first scenario which makes it more relevant in the overall consumed energy. 
+Indeed, the static energy is related to the execution time and if the performance is  degraded the total consumed 
+static energy is directly increased. Therefore, the proposed algorithm do not scales down much the frequencies of the 
+nodes  in order to limit the increase of the execution time and thus limiting the effect of the consumed static energy .
+
+The two new power scenarios are compared to the old one in figure (\ref{fig:sen_comp}). It shows the average of 
+the performance degradation, the energy saving and the distances for all NAS benchmarks of class C running on 8 or 9 nodes. 
+The comparison shows that  the energy saving ratio is proportional to the dynamic power ratio: it is increased 
+when applying the  90\%-10\% scenario because at maximum frequency the dynamic  energy is the the most relevant 
+in the overall consumed energy and can be reduced by lowering the frequency of some processors. On the other hand, 
+the energy saving is decreased when  the 70\%-30\% scenario is used because the dynamic  energy is less relevant in 
+the overall consumed energy and lowering the frequency do not returns big energy savings.
+Moreover, the average of the performance degradation is decreased when using a higher ratio for static power 
+(e.g. 70\%-30\% scenario and 80\%-20\% scenario). Since the proposed algorithm optimizes the energy consumption 
+when using a higher ratio for dynamic power the algorithm selects bigger frequency scaling factors that result in 
+more energy saving but less performance, for example see the figure (\ref{fig:scales_comp}). The opposite happens 
+when using a higher ratio for  static  power, the algorithm proportionally  selects  smaller scaling values which 
+results in less energy saving but less performance degradation. 

 
 
  \begin{table}[htb]
 
 
  \begin{table}[htb]


@@ -742,23 +1051,29 @@ Moreover, the average of the performance degradation is decreased when using a h
 
 
 
 
 
 

-\subsection{The verifications of the proposed method}
-\label{sec.verif}
-The precision of the proposed algorithm mainly depends on the execution time prediction model defined in EQ(\ref{eq:perf}) and the energy model computed by EQ(\ref{eq:energy}). 
-The energy model is also significantly dependent  on the execution time model because the static energy is linearly related the execution time and the dynamic energy is related to the computation time. So, all of the work presented in this paper is based on the execution time model. To verify this model, the predicted execution time was compared to  the real execution time over Simgrid for all  the NAS parallel benchmarks running class B on 8 or 9 nodes. The comparison showed that the proposed execution time model is very precise, the maximum normalized difference between  the predicted execution time  and the real execution time is equal to 0.03 for all the NAS benchmarks.

 
 

-Since  the proposed algorithm is not an exact method and do not test all the possible solutions (vectors of scaling factors) in the search space and to prove its efficiency, it was compared on small instances to a brute force search algorithm that tests all the possible solutions. The brute force algorithm was applied to different NAS benchmarks classes with different number of nodes. The solutions returned by the brute force algorithm and the proposed algorithm were identical and the proposed algorithm was on average 10 times faster than the 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$ 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 section (\ref{sec.res}).

 
 \section{Conclusion}
 
 \section{Conclusion}

-\label{sec.concl}
-
+\label{sec.concl} 
+In this paper, we have presented a new online selecting frequency scaling factors algorithm
+that selects the best possible vector of frequency scaling factors for a heterogeneous platform. 
+This vector gives the maximum distance (optimal tradeoff) between the predicted energy and 
+the predicted performance curves. In addition, we developed a new energy model for measuring  
+and predicting the energy of distributed iterative applications running over heterogeneous 
+cluster. The proposed method evaluated on Simgrid/SMPI  simulator to built a heterogeneous 
+platform to executes NAS parallel benchmarks. The results of the experiments showed the ability of
+the proposed algorithm to changes its behaviour to selects different scaling factors  when 
+the number of computing nodes and both of the static and the dynamic powers are changed. 
+
+In the future, we plan to improve this method to apply on asynchronous  iterative applications 
+where each task does not wait the others tasks to finish there works. This leads us to develop a new 
+energy model to an asynchronous iterative applications, where the number of iterations is not 
+known in advance and depends on the global convergence of the iterative system.

 
 \section*{Acknowledgment}
 
 
 
 \section*{Acknowledgment}
 
 

+

 % trigger a \newpage just before the given reference
 % number - used to balance the columns on the last page
 % adjust value as needed - may need to be readjusted if
 % trigger a \newpage just before the given reference
 % number - used to balance the columns on the last page
 % adjust value as needed - may need to be readjusted if