-cluster composed of Intel Xeon CPUs and NVIDIA GPUs. Their main goal is to determined the
-energy efficiency as a function of performance per watt, the best tradeoff is done when the
-performance per watt function is maximized. In the work of Kia Ma et al.
-~\cite{KaiMa_Holistic.Approach.to.Energy.Efficiency.in.GPU-CPU}, they developed a scheduling
-algorithm to distributed different workloads proportional to the computing power of the node
-to be executed on CPU or GPU, emphasize all tasks must be finished in the same time.
-Recently, Rong et al.~\cite{Rong_Effects.of.DVFS.on.K20.GPU}, Their study explain that
-a heterogeneous clusters enabled DVFS using GPUs and CPUs gave better energy and performance
-efficiency than other clusters composed of only CPUs.
-The CPUs-CPUs heterogeneous clusters consist of number of computing nodes all of the type CPU.
-Our work in this paper can be classified to this type of the clusters.
-As an example of these works see Naveen et al.~\cite{Naveen_Power.Efficient.Resource.Scaling} work,
-They developed a policy to dynamically assigned the frequency to a heterogeneous cluster.
-The goal is to minimizing a fixed metric of $energy*delay^2$. Where our proposed method is automatically
-optimized the relation between the energy and the delay of the iterative applications.
-Other works such as Lizhe et al.~\cite{Lizhe_Energy.aware.parallel.task.scheduling},
-their algorithm divided the executed tasks into two types: the critical and
-non critical tasks. The algorithm scaled down the frequency of the non critical tasks
-as function to the amount of the slack and communication times that
-have with maximum of performance degradation percentage less than 10\%. In our method there is no
-fixed bounds for performance degradation percentage and the bound is dynamically computed
-according to the energy and the performance tradeoff relation of the executed application.
-There are some approaches used a heterogeneous cluster composed from two different types
-of Intel and AMD processors such as~\cite{Joshi_Blackbox.prediction.of.impact.of.DVFS}
-and \cite{Spiliopoulos_Green.governors.Adaptive.DVFS}, they predicated both the energy
-and the performance for each frequency gear, then the algorithm selected the best gear that gave
-the best tradeoff. In contrast our algorithm works over a heterogeneous platform composed of
-four different types of processors. Others approaches such as
-\cite{Shelepov_Scheduling.on.Heterogeneous.Multicore} and \cite{Li_Minimizing.Energy.Consumption.for.Frame.Based.Tasks},
-they are selected the best frequencies for a specified heterogeneous clusters offline using some
-heuristic methods. While our proposed algorithm works online during the execution time of
-iterative application. Greedy dynamic approach used by Chen et al.~\cite{Chen_DVFS.under.quality.of.service.requirements},
-minimized the power consumption of a heterogeneous severs with time/space complexity, this approach
-had considerable overhead. In our proposed frequency selecting algorithm has very small overhead and
-it is works without any previous analysis for the application time complexity. The primary
-contributions of our paper are :
+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 :
