Introduction

diff --git a/Heter_paper.tex b/Heter_paper.tex
index 23ea28d7993297251bdf287cf9428e85185f184b..690c6a18fdb7d1a8830b2d611e164d985649c1e6 100644 (file)
--- a/Heter_paper.tex
+++ b/Heter_paper.tex
@@ -81,14 +81,27 @@
 
 \section{Introduction}
 \label{sec.intro}
 
 \section{Introduction}
 \label{sec.intro}

-
+Modern processors continue to increased in a performance, achieved  maximum number of floating point operations per second (FLOPS), thus the energy consumption and the heat dissipation are increased drastically  according to this increase. The number of FLOPS is linearly related to power consumption of a CPU~\cite{51}.  
+As an example of more power hungry cluster, according to the Top500 list in June 2014 \cite{43}, Tianhe-2 has more than 3 millions of cores and consumed more  than 17.8 megawatt per second. Moreover, according to the U.S. annual energy outlook 2014 \cite{60}, the price of energy for 1 megawatt per hour is approximately equal to 70\$ (1.16\$ for megawatt per second). Therefore, we can consider the price of the energy consumption for the Tianhe-2 platform is approximately more than 390 millions dollars of megawatt per year. For this reason, the heterogeneous clusters must be offer more energy efficiency due to the increase in the energy cost and the environment influences. Therefore, a green computing clusters are require nowadays.  For example, the GSIC center of Tokyo  heterogeneous cluster became the top of the Green500 list in June 2014 \cite{59}. This platform  has more than four thousand of  MFLOPS per watt. Dynamic voltage and frequency scaling (DVFS) is a process used widely to reduce the energy consumption of the processor. In a heterogeneous clusters enabled DVFS, many researchers used DVFS  in a different ways. DVFS can be minimized the energy consumption but it lead to a disadvantage due to the performance degradation increase. Therefore,  researchers used different optimization strategies to overcame this problem. The best tradeoff relation between the energy reduction and performance degradation ratio is become a key challenges in a heterogeneous platforms. In this paper we are propose a heterogeneous scaling algorithm  that selects the optimal vector of the frequency scaling factors for distributed iterative application, producing minimum energy saving against minimum performance degradation ratio simultaneously. The algorithm has very small overhead, works online and not needs for 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 MPI programs can be predicted.  It also presents an energy
+model for heterogeneous platforms. 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 heterogeneous scaling algorithm.
+Section~\ref{sec.expe} presents the results of running  the NAS benchmarks on 
+the proposed heterogeneous platform. It also shows the comparison of three different power
+scenarios and it verifies the precision of the proposed algorithm.  Finally, we conclude 
+in Section~\ref{sec.concl} with a summary and some future works.

 
 \section{Related works}
 \label{sec.relwork}
 Energy reduction process for a high performance clusters recently performed using dynamic voltage and frequency scaling (DVFS) technique. DVFS is a technique  enabled in a modern processors to scaled down both of the  voltage and the frequency of the CPU while it is in the computing mode to reduce the energy consumption. DVFS is also  allowed in the graphical processors GPUs, to achieved the same goal. Applying DVFS has a dramatical side effect if it is applied to minimum levels to gain more energy reduction, producing a high percentage of performance degradations for the parallel applications.  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 for a heterogeneous cluster to simultaneously optimize both the energy and the execution time  without adding a big overhead.
 
 \section{Related works}
 \label{sec.relwork}
 Energy reduction process for a high performance clusters recently performed using dynamic voltage and frequency scaling (DVFS) technique. DVFS is a technique  enabled in a modern processors to scaled down both of the  voltage and the frequency of the CPU while it is in the computing mode to reduce the energy consumption. DVFS is also  allowed in the graphical processors GPUs, to achieved the same goal. Applying DVFS has a dramatical side effect if it is applied to minimum levels to gain more energy reduction, producing a high percentage of performance degradations for the parallel applications.  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 for a heterogeneous cluster to simultaneously optimize both the energy and the execution time  without adding a big overhead.

-This work is developed from our previous work of a homogeneous cluster~\cite{45}. Therefore we are interested to present some works that concerned the heterogeneous clusters enabled DVFS. In general, the heterogeneous cluster works fall into two categorizes: GPUs-CPUs heterogeneous clusters and CPUs-CPUs heterogeneous clusters. In GPUs-CPUs heterogeneous clusters some parallel tasks executed on a GPUs and the others executed on a CPUs. As an example of this works, Luley et al.~\cite{51}, proposed  a heterogeneous 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{49}, They developed a scheduling algorithm to distribute different workloads proportional to the computing power of the node to be executed on a CPU or a GPU, emphasize all tasks must be finished in the same time. 
+This work is developed from our previous work of a homogeneous cluster~\cite{45}. Therefore we are interested to present some works that concerned the heterogeneous clusters enabled DVFS. In general, the heterogeneous cluster works fall into two categorizes: GPUs-CPUs heterogeneous clusters and CPUs-CPUs heterogeneous clusters. In GPUs-CPUs heterogeneous clusters some parallel tasks executed on a GPUs and the others executed on a CPUs. As an example of this works, Luley et al.~\cite{51}, proposed  a heterogeneous 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{49}, They developed a scheduling algorithm to distributed different workloads proportional to the computing power of the node to be executed on a CPU or a GPU, emphasize all tasks must be finished in the same time. 

 Recently, Rong et al.~\cite{50}, 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 this works see  Naveen et al.~\cite{52} 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{53}, 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 of 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{54} and \cite{55}, 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{56} and \cite{57}, 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{58},  minimized the power consumption of a heterogeneous severs  with time/space complexity, this approach had considerable overhead. In our proposed scaling algorithm has very small overhead and it is works without any previous analysis for the application time complexity. 
 Recently, Rong et al.~\cite{50}, 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 this works see  Naveen et al.~\cite{52} 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{53}, 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 of 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{54} and \cite{55}, 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{56} and \cite{57}, 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{58},  minimized the power consumption of a heterogeneous severs  with time/space complexity, this approach had considerable overhead. In our proposed scaling algorithm has very small overhead and it is works without any previous analysis for the application time complexity. 


@@ -112,7 +125,7 @@ have the same network bandwidth and latency.
 
 
 
 
 
 

- 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
+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.
  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.


@@ -215,8 +228,7 @@ reducing the frequency by a factor of $S$~\cite{3}. Since the FLOPS of a CPU is
 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  
 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: 
+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 (Tcp \cdot S  + Tcm)
 \begin{equation}
   \label{eq:Estatic}
  E_\textit{s} = P_\textit{s} \cdot (Tcp \cdot S  + Tcm)


@@ -266,7 +278,7 @@ In the same way, we normalize the energy by computing the ratio between the cons
   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)} +
   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}).
 
 \end{multline} 
 Where $T_{New}$ and $T_{Old}$ are computed as in EQ(\ref{eq:pnorm}).
 


@@ -425,7 +437,7 @@ To evaluate the efficiency and the overall energy consumption reduction of algor
 \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
 \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.
+(\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{45,3}. Finally, These nodes were connected via an ethernet network with 1 Gbit/s bandwidth.

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

diff --git a/my_reference.bib b/my_reference.bib
index e7163036c5432ea6e1f090b1403c975c9e5030d3..b2acf7a2f71809803525405f2f2f3c63c38d9332 100644 (file)
--- a/my_reference.bib
+++ b/my_reference.bib
@@ -804,3 +804,12 @@ doi={10.1109/IGCC.2011.6008552}
        
 }
 
        
 }
 

+@MISC{59,
+  title =        {{The Green500 List of Heterogeneous Supercomputing Systems}},
+  url =          {http://www.green500.org}
+}
+
+@MISC{60,
+  title =        {{U.S. Energy Information Administration, Annual Energy Outlook 2014}},
+  url =          {http://www.eia.gov/}
+}
\ No newline at end of file