variability has been ignored. What would be the solution for that?
Consider variability in the model.
-\textbf{Answer:} In this paper we have considered that the application executes regular iterations over stable computers computing only this application. Therefore, we have assumed that the execution times of all the iterations of the application executed on the same computing node should be almost the same. For this reason we did not take into consideration the variability of the computer system. Moreover, applying the frequency scaling algorithm after many iterations would reduce its impact on the energy consumption especially for applications executing a relatively low number of iterations.
+\textbf{Answer:} In this paper we have considered that the application executes regular iterations over stable machines computing only this application. Therefore, we have assumed that the execution times of all the iterations of the application executed on the same computing node should be almost the same. For this reason we did not take into consideration the variability of the computer system. Moreover, applying the frequency scaling algorithm after many iterations would reduce its impact on the energy consumption especially for applications executing a relatively low number of iterations.
However, the variability of the computing system can be taken into consideration in a future work. For example, the proposed algorithm can be executed twice: after the first iteration the frequencies are scaled down according to the execution times measured in the first iteration, then after a fixed number of iterations, the frequencies are adjusted according to the execution times measured during the fixed number of iterations. If the computing power of the system is constantly changing, it would be interesting to implement a mechanism that detects this change and adjusts the frequencies according to the variability of the system.
- Taking account of the variability of the system has been added as a perspective at the end of the paper.
+ Taking the variability of the system into account has been added as a perspective at the end of the paper.
\item Another point is that you mention
site/32, two sites/16, two sites/32). I believe it would be much
easier to compare and avoid the problem of lines.
- \textbf{Answer:} We agree with the reviewer. The curves in Figures 6 and 8 in the paper were replaced by histograms.
+ \textbf{Answer:} We agree with the reviewer. The curves in Figures 6 and 8 in the paper have been replaced by histograms.
detected by MPI if you pin processes to cores).
\textbf{Answer:} We did not manually pin processes to cores. Since the communication times
-increased, we think that the shared memory was not used when two processes, running on the same node, exchange data.
+have increased, we think that the shared memory was not used when two processes, running on the same node, exchange data.
\item In P33, Sec 6.5, you mention that the proposed algorithm outperforms
EDP because the former considers both metrics (time, energy) and the
+ Same for Fig 7.
- \textbf{Answer:} Answer: We have taken in consideration all these remarks and the paper was modified accordingly.
+ \textbf{Answer:} We have taken in consideration all these remarks and the paper has been modified accordingly.
\item From the design of experiments, did you consider using replications?
There is no variability metric in your results. Have you run multiple
\item In summary, I think this is a very interesting work but the experimental evaluation lacks variability measurements, consider larger experiments (1K nodes for instance) to see how everything scales, and there is no overhead measurements although authors stress that in abstract/introduction.
-\textbf{Answer:} For the time being, we do not have the resources nor the time to evaluate the proposed algorithm over large platforms composed of more than 1K nodes. However, as said in the perspectives of the paper, the evaluation of the scalability of the algorithm will be in a conducted in a future work as soon as we have access to larger resources. We have discussed the overhead of the algorithm and its complexity in section 6.5 and given in the answer to question 2 some solutions to improve its scalability and reduce its overhead.
+\textbf{Answer:} For the time being, we do not have the resources nor the time to evaluate the proposed algorithm over large platforms composed of more than 1K nodes. However, as said in the perspectives of the paper, the evaluation of the scalability of the algorithm will be conducted in a future work as soon as we have access to larger resources. We have discussed the overhead of the algorithm and its complexity in section 6.5 and given in the answer to question 2 some solutions to improve its scalability and reduce its overhead.
For the variability issue, please refer to the answer to question 1.
\begin{enumerate}
\item Move the contributions from related work to introduction.
-\textbf{Answer:} The contributions were moved to the introduction section.
+\textbf{Answer:} The contributions have been moved to the introduction section.
\item Why emphasize it is a grid platform? the presentation of related work follows the logic of heterogeneous CPUs. Grid is only a type of platform with heterogeneous CPUs.
\item Figure 1 is not clearly explained. Where is the slack time in figure 1 and why slack time =0 for task 1?
-\textbf{Answer:} Figure 1 was redrawn, the white space before the barrier is the slack time. Slack times occur when a node has to wait for another node to finish its computation to synchronously communicate with it. In Figure 1, task 1 was assumed to be the slowest task. All the other tasks will finish their computations before the slowest task and wait until it finishes its computation before being able to synchronously communicate with it. This waiting time is the slack time and since the slowest task do not have to wait for the other tasks it has almost no slack time.
+\textbf{Answer:} Figure 1 was redrawn, the white space before the barrier is the slack time. Slack times occur when a node has to wait for another node to finish its computation to synchronously communicate with it. In Figure 1, task 1 was assumed to be the slowest task. All the other tasks will finish their computations before the slowest task and wait until it finishes its computation before being able to synchronously communicate with it. This waiting time is the slack time and since the slowest task does not have to wait for the other tasks, there is almost no slack time.
\item Define the parameters in eq. 1.
\item What is the communication time without slack time?
-\textbf{Answer:} There is no synchronous communications with zero slack times, but if a node sends a message to another node who is already waiting for that message. The latter will acknowledge the reception of the message from the sender without any delay. On the other hand, if the receiving node is still computing the sender has to wait for it to finish its computation to acknowledge the reception of the message. This time is called the slack time.
+\textbf{Answer:} There is no synchronous communication with zero slack times, but if a node sends a message to another node that is already waiting for that message, the latter will acknowledge the reception of the message from the sender without any delay. On the other hand, if the receiving node is still computing the sender has to wait for it to finish its computation to acknowledge the reception of the message. This time is called the slack time.
\item In equation, min operation is used to get the communication time, but in text, it says to use the slowest communication time, which should use the max operation then.
\item Discuss the difference between eq. 2 and the prediction model in references \cite{4} and \cite{5}.
-\textbf{Answer:} The prediction models in \cite{4} and \cite{5} are for homogeneous and heterogeneous clusters respectively, while the model in Equation 2 is adapted for grids. We have adapted the prediction models to the used architecture. Each architecture has its own characteristics. For example, in a homogeneous cluster all the nodes have the same specifications and only one scaling factor is computed by the algorithm to all the nodes of the cluster.
-On the other hand, in a heterogeneous cluster, the nodes may have different specifications and a scaling factor should be computed to each node. The prediction models of a heterogeneous cluster can be used for a homogeneous cluster. In the same the models in this paper take more characteristics into considerations such as different networks to be adapted for grids and they can also be applied to a heterogeneous cluster. Therefore, the models presented in this paper are more complete than those presented in \cite{4} and \cite{5} and take more characteristics into consideration.
+\textbf{Answer:} The prediction models in \cite{4} and \cite{5} are for homogeneous and heterogeneous clusters respectively, while the model in Equation 2 is adapted for grids. We have adapted the prediction models to the used architecture. Each architecture has its own characteristics. For example, in a homogeneous cluster all the nodes have the same specifications and only one scaling factor is computed by the algorithm for all the nodes of the cluster.
+On the other hand, in a heterogeneous cluster, the nodes may have different specifications and a scaling factor should be computed for each node. The prediction models of a heterogeneous cluster can be used for a homogeneous cluster. In the same way, the models in this paper take more characteristics into consideration such as different networks to be adapted for grids and they can also be applied to a heterogeneous cluster. Therefore, the models presented in this paper are more complete than those presented in \cite{4} and \cite{5} and take more characteristics into consideration.
\item Eq. 10: Can the authors comment on the energy consumed by communications?
-\textbf{Answer:} During communications, the CPU only consumes the static power power and during computations it consumes both dynamic and static power. For more information the reviewer can refer to \cite{3}.
+\textbf{Answer:} During communications, the CPU only consumes the static power and during computations it consumes both dynamic and static power. For more information the reviewer can refer to \cite{3}.
\item This work assume homogeneous cpu in one cluster. Line 55 says: even if the distributed message
passing iterative application is load balanced, the computation time of each cpu j in cluster i may be different Why?
\item Comment why the applications in NAS parallel benchmark are iterative application? These applications are normally run in one cluster. Describe in more detail how they are run across multiple clusters.
-\textbf{Answer:} The sentence ``iterative applications'' was replaced by ``applications with iterations'' because the proposed algorithm can be applied to any application that executes the same block of instructions many times and it is not limited to iterative methods that terminate when they converge. The NAS parallel benchmarks are application with iterations because they iterate the same block of instructions until convergence or for fixed number of iterations. These benchmarks can be executed on any distributed memory platform such as clusters or grids with no required modifications. Since, we have deployed the same operating system on all the nodes, we just compile the source on one node and then copy the executable program on all the nodes. The application can then be executed with an ``mpirun'' command that takes three arguments:
+\textbf{Answer:} The sentence ``iterative applications'' was replaced by ``applications with iterations'' because the proposed algorithm can be applied to any application that executes the same block of instructions many times and it is not limited to iterative methods that terminate when they converge. The NAS parallel benchmarks are applications with iterations because they iterate the same block of instructions until convergence or for a fixed number of iterations. These benchmarks can be executed on any distributed memory platform such as clusters or grids with no required modifications. Since we have deployed the same operating system on all the nodes, we just compile the source on one node and then copy the executable program on all the other nodes. The application can then be executed with an ``mpirun'' command that takes three arguments:
\begin{itemize}
\item the name of the application to execute
\item the number of processes required to execute the application
\end{itemize}
\item Broken sentence in line 28 on page 12.
-\textbf{Answer:} The sentence was corrected.
+\textbf{Answer:} The sentence has been corrected.
\item Why $T_{old}$ is computed using eq. 12, which applies MAX over computation time and communication time, while in $T_{new}$, max and min operations are applied over computation and communication separately?
\item Authors comment whether (and how) the proposed methods can be applied/extended to other programming models and/or platform, such as mapreduce, heterogeneous cluster with CPU+GPU.
\textbf{Answer:} The proposed method can only be applied to parallel models with iterations
-and with or without message passing. If only a few map and reduce operations are executed in the application and these operations are not iterative, the proposed algorithm cannot be adapted to that type of applications. On the other hand, if the map or reduce operations are iterative, the proposed algorithm can be applied when executing these operations. Finally, if in the application, the same map and reduce operations are executed many times iteratively, the proposed algorithm can then be applied to the whole application while considering that an iteration consists of a map operation followed by a reduce operation.
+and with or without message passing. If only a few map and reduce operations are executed in the application and these operations are not iterative, the proposed algorithm cannot be adapted to that type of applications. On the other hand, if the map or reduce operations are iterative, the proposed algorithm can be applied when executing these operations. Finally if, in the application, the same map and reduce operations are executed many times iteratively, the proposed algorithm can then be applied to the whole application while considering that an iteration consists of a map operation followed by a reduce operation.
The proposed method with some adaptations can be applied to applications with iterations running on heterogeneous platforms composed of GPUs and CPUs because modern GPUs like CPUs allow the use of DVFS.
\end{enumerate}
\textbf{Answer:} The experiments were not only conducted over 16 nodes, but they were also executed over 32 nodes distributed over three clusters.
In \cite{5} the algorithm was evaluated on a simulated heterogeneous cluster composed of up to 144 nodes. The overhead of the algorithm was very small, just 0.15 ms.
- The experiments were not conducted on more than 32 nodes of Grid'5000 because it does not have many nodes that allow DVFS operations and have energy measurement tools. We agree with the reviewer that experiments using much more nodes should be conducted to evaluate the scalability of the proposed algorithm and when we will have access to such platforms, we will evaluate the proposed method over a larger number of nodes.
+ The experiments were not conducted on more than 32 nodes of Grid'5000 because it does not have many nodes that allow DVFS operations and have energy measurement tools. We agree with the reviewer that experiments using much larger number of nodes should be conducted to evaluate the scalability of the proposed algorithm and when we have access to such platforms, we will evaluate the proposed method over a larger number of nodes.
\item The energy saving is actually calculated by the quantitative formula instead of the real measurements. Can you have any discussions on the real measurements?
\textbf{Answer:} In the comparison section 6.5, we have presented the execution time of the algorithm when it is executed over 32 nodes from three clusters and located in two different sites. It takes on average 0.01 $ms$. In \cite{5} the algorithm was evaluated on a simulated heterogeneous cluster composed of up to 144 nodes. The overhead of the algorithm was just 0.15 ms.
-The algorithm works online without profiling means it only uses the measured communication and computation times during the run-time and do not require to profile the application before run-time. Some methods use profilers before executing the application to gather a lot of information about the application such as computations to communication ratios and dependencies between tasks. The gathered information is used to scale the frequency of each node before executing the application.
+The sentence : ``the algorithm works online without profiling'' means that it only uses the measured communication and computation times during the run-time and does not require to profile the application before run-time. Some methods use profilers before executing the application to gather a lot of information about the application such as computations to communication ratios and dependencies between tasks. The gathered information is used to scale the frequency of each node before executing the application.
-The algorithm works without training because it does not require the partial or the total execution of the application before run-time. Indeed, some applications run parts of the application while using various frequencies to measure in advance their energy consumption. Then, using these values they select the the frequency of each node before executing the application.
+The algorithm works without training because it does not require the partial or the total execution of the application before run-time. Indeed, some applications run parts of the application while using various frequencies to measure their energy consumption in advance. Then, using these values, they select the frequency of each node before executing the application.
\end{enumerate}
\bibliographystyle{plain}
