From: afanfakh Date: Thu, 20 Mar 2014 10:19:34 +0000 (+0100) Subject: some changes X-Git-Tag: ispa14_submission~30 X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/mpi-energy.git/commitdiff_plain/5122afb83c5f5b83abac8b089aab1dfce812728b?ds=inline;hp=-c some changes --- 5122afb83c5f5b83abac8b089aab1dfce812728b diff --git a/compare_class_c.pdf b/compare_class_c.pdf index 5170c60..99d9365 100644 Binary files a/compare_class_c.pdf and b/compare_class_c.pdf differ diff --git a/paper.tex b/paper.tex index 9ab93a9..aecd79e 100644 --- a/paper.tex +++ b/paper.tex @@ -362,7 +362,7 @@ simultaneously. But the main objective is to produce maximum energy reduction with minimum performance reduction. Many researchers used different strategies to solve this nonlinear problem for example see~\cite{19,42}, their methods add big overhead to the algorithm for selecting the suitable frequency. In this -paper we are present a method to find the optimal scaling factor \emph S for +paper we present a method to find the optimal scaling factor \emph S for optimize both energy and performance simultaneously without adding big overheads. Our solution for this problem is to make the optimization process have the same direction. Therefore, we inverse the equation of normalize @@ -381,7 +381,7 @@ performance as follows: \subfloat[Real Relation.]{% \includegraphics[width=.4\textwidth]{file3.eps}\label{fig:r2}} \label{fig:rel} - \caption{The Energy and Performance Relation} + \caption{The Relation of Energy and Performance } \end{figure*} Then, we can modelize our objective function as finding the maximum distance between the energy curve EQ~(\ref{eq:enorm}) and the inverse of performance @@ -454,14 +454,14 @@ in the MPI program. \caption{DVFS} \label{dvfs} \begin{algorithmic}[1] - \For {$J:=1$ to $Some-Iterations \; $} + \For {$J=1$ to $Some-Iterations \; $} \State -Computations Section. \State -Communications Section. \If {$(J=1)$} \State -Gather all times of computation and\par\hspace{13 pt} communication from each node. \State -Call EPSA with these times. \State -Calculate the new frequency from optimal scale. - \State -Set the new frequency to the system. + \State -Change the new frequency of the system. \EndIf \EndFor \end{algorithmic} @@ -494,7 +494,7 @@ frequencies. We increased this range to verify the EPSA algorithm takes small ex time while it has a big number of available frequencies. The simulated network link is 1 GB Ethernet (TCP/IP). The backbone of the cluster simulates a high performance switch. \begin{table}[htb] - \caption{Platform File Parameters} + \caption{SimGrid Platform File Parameters} % title of Table \centering \begin{tabular}{|*{7}{l|}} @@ -530,7 +530,7 @@ This lead to 18 run states for each program. We use seven MPI programs of the NAS parallel benchmarks: CG, MG, EP, FT, BT, LU and SP. The average normalized errors between the predicted execution time and the real time (SimGrid time) for all programs is between 0.0032 to 0.0133. AS an -example, we are present the execution times of the NAS benchmarks as in the +example, we present the execution times of the NAS benchmarks as in the figure~(\ref{fig:pred}). \subsection{The EPSA Results} @@ -569,7 +569,7 @@ same time over all available scales. \includegraphics[width=.33\textwidth]{lu.eps}\hfill% \includegraphics[width=.33\textwidth]{bt.eps}\hfill% \includegraphics[width=.33\textwidth]{ft.eps} - \caption{Optimal scaling factors for The NAS MPI Programs} + \caption{The Discovered scaling factors for NAS MPI Programs} \label{fig:nas} \end{figure*} \begin{table}[htb] @@ -737,7 +737,7 @@ NAS benchmarks programs for classes A,B and C. \end{table} As shown in these tables our scaling factor is not optimal for energy saving such as Rauber and Rünger scaling factor EQ~(\ref{eq:sopt}), but it is optimal for both -the energy and the performance simultaneously. Our $EPSA$ optimal scaling factors +the energy and the performance simultaneously. Our EPSA optimal scaling factors has better simultaneous optimization for both the energy and the performance compared to Rauber and Rünger energy-performance method ($R_{E-P}$). Also, in ($R_{E-P}$) method when setting the frequency to maximum value for the @@ -761,12 +761,12 @@ than the first. \includegraphics[width=.33\textwidth]{compare_class_A.pdf} \includegraphics[width=.33\textwidth]{compare_class_B.pdf} \includegraphics[width=.33\textwidth]{compare_class_c.pdf} - \caption{Comparing Our EPSA with Rauber and Rünger Methods} + \caption {Comparing Our EPSA with Rauber and Rünger Methods} \label{fig:compare} \end{figure} \section{Conclusion} \label{sec.concl} -In this paper we develop the simultaneous energy-performance algorithm. It works based on the trade off relation between the energy and performance. The results showed that when the scaling factor is big value refer to more energy saving. Also, when the scaling factor is smaller value, Then it has bigger impact on performance than energy. The algorithm optimizes the energy saving and performance in the same time to have positive trade off. The optimal trade off represents the maximum distance between the energy and the inversed performance curves. Also, the results explained when setting the slowest task to maximum frequency usually not have a big improvement on performance. In future, we will apply the EPSA algorithm on heterogeneous platform. +In this paper we developed the simultaneous energy-performance algorithm. It works based on the trade off relation between the energy and performance. The results showed that when the scaling factor is big value refer to more energy saving. Also, when the scaling factor is smaller value, Then it has bigger impact on performance than energy. The algorithm optimizes the energy saving and performance in the same time to have positive trade off. The optimal trade off represents the maximum distance between the energy and the inversed performance curves. Also, the results explained when setting the slowest task to maximum frequency usually not have a big improvement on performance. In future, we will apply the EPSA algorithm on heterogeneous platform. \section*{Acknowledgment} Computations have been performed on the supercomputer facilities of the