Reintroduce changes lost by last merge.

[mpi-energy.git] / paper.tex

diff --git a/paper.tex b/paper.tex
index 0be7216c6e3e568175e189ca3c22634e66284616..e3efb3257951e5b69b9b5005508b67e1df4dcbe3 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -16,6 +16,7 @@
 \usepackage{xspace}
 \usepackage[textsize=footnotesize]{todonotes}
 \newcommand{\AG}[2][inline]{\todo[color=green!50,#1]{\sffamily\textbf{AG:} #2}\xspace}
 \usepackage{xspace}
 \usepackage[textsize=footnotesize]{todonotes}
 \newcommand{\AG}[2][inline]{\todo[color=green!50,#1]{\sffamily\textbf{AG:} #2}\xspace}

+\newcommand{\JC}[2][inline]{\todo[color=red!10,#1]{\sffamily\textbf{JC:} #2}\xspace}

 
 \begin{document}
 
 
 \begin{document}
 


@@ -31,14 +32,15 @@
   \IEEEauthorblockA{%
     FEMTO-ST Institute\\
     University of Franche-Comté\\
   \IEEEauthorblockA{%
     FEMTO-ST Institute\\
     University of Franche-Comté\\

-    IUT de Belfort-Montb\'{e}liard, Rue Engel Gros, BP 27, 90016 Belfort, France\\
-   Fax  : (+33)~3~84~58~77~32\\
-   Email: \{jean-claude.charr, raphael.couturier, ahmed.fanfakh, arnaud.giersch\}@univ-fcomte.fr
+    IUT de Belfort-Montbéliard, 19 avenue du Maréchal Juin, BP 527, 90016 Belfort cedex, France\\
+    Fax  : +33~3~84~58~77~32\\
+    Email: \{jean-claude.charr,raphael.couturier,ahmed.fanfakh\_badri\_muslim,arnaud.giersch\}@univ-fcomte.fr

    }
   }
 
 \maketitle
 
    }
   }
 
 \maketitle
 

+\AG{Is the fax number correct? Shall we add a telephone number?}

 \begin{abstract}
   Dynamic Voltage Frequency Scaling (DVFS) can be applied to modern CPUs. 
 This technique is usually used to reduce the energy consumed by a CPU while
 \begin{abstract}
   Dynamic Voltage Frequency Scaling (DVFS) can be applied to modern CPUs. 
 This technique is usually used to reduce the energy consumed by a CPU while


@@ -114,7 +116,7 @@ we conclude in Section~\ref{sec.concl}.
 \section{Related works}
 \label{sec.relwork}
 
 \section{Related works}
 \label{sec.relwork}
 

-\AG{Consider introducing the models sec.~\ref{sec.exe} maybe before related works}
+\AG{Consider introducing the models (sec.~\ref{sec.exe}) before related works}

 
 In this section, some heuristics to compute the scaling factor are
 presented and classified into two categories: offline and online methods.
 
 In this section, some heuristics to compute the scaling factor are
 presented and classified into two categories: offline and online methods.


@@ -164,7 +166,7 @@ The primary contribution of this paper is presenting a new online scaling factor
 
 \section{Execution and energy of parallel tasks on homogeneous platform} 
 \label{sec.exe}
 
 \section{Execution and energy of parallel tasks on homogeneous platform} 
 \label{sec.exe}

-%\AG{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}
+%\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{Parallel tasks execution on homogeneous platform}
 A homogeneous cluster consists of identical nodes in terms of hardware and software. 
 Each node has its own memory and at least one processor which can
 \subsection{Parallel tasks execution on homogeneous platform}
 A homogeneous cluster consists of identical nodes in terms of hardware and software. 
 Each node has its own memory and at least one processor which can


@@ -264,7 +266,7 @@ EQ~(\ref{eq:energy}). The optimal scaling factor is computed by minimizing the d
     \left( 1 + \sum_{i=2}^{N} \frac{T_i^3}{T_1^3} \right) }
 \end{equation}
 
     \left( 1 + \sum_{i=2}^{N} \frac{T_i^3}{T_1^3} \right) }
 \end{equation}
 

-\AG{The following 2 sections can be merged easily}
+\JC{The following 2 sections can be merged easily}

 
 \section{Performance evaluation of MPI programs}
 \label{sec.mpip}
 
 \section{Performance evaluation of MPI programs}
 \label{sec.mpip}


@@ -551,7 +553,9 @@ optimal level without considering the performance as in EQ~(\ref{eq:sopt}). We
 refer to this scenario as $R_{E}$. The second scenario is similar to the first
 except setting the slower task to the maximum frequency (when the scale $S=1$)
 to keep the performance from degradation as mush as possible. We refer to this
 refer to this scenario as $R_{E}$. The second scenario is similar to the first
 except setting the slower task to the maximum frequency (when the scale $S=1$)
 to keep the performance from degradation as mush as possible. We refer to this

-scenario as $R_{E-P}$. While we refer to our algorithm as EPSA. The comparison is made in tables~(\ref{table:compareA},\ref{table:compareB},\ref{table:compareC}). These
+scenario as $R_{E-P}$. While we refer to our algorithm as EPSA. The comparison
+is made in tables \ref{table:compareA}, \ref{table:compareB},
+and~\ref{table:compareC}. These

 tables show the results of our method and Rauber and Rünger scenarios for all the
 NAS benchmarks programs for classes A,B and C.
 \begin{table}[p]
 tables show the results of our method and Rauber and Rünger scenarios for all the
 NAS benchmarks programs for classes A,B and C.
 \begin{table}[p]


@@ -703,6 +707,7 @@ In the near future, we would like to adapt this scaling factor selection method
 
 
 \section*{Acknowledgment}
 
 
 \section*{Acknowledgment}

+\AG{Jean-Claude, why did you remove the Mésocentre here?}

 As a PhD student, M. Ahmed Fanfakh, would like to thank the University of
 Babylon (Iraq) for supporting his work.
 
 As a PhD student, M. Ahmed Fanfakh, would like to thank the University of
 Babylon (Iraq) for supporting his work.