predict both energy consumption and execution time over all available scaling
factors. The prediction achieved depends on some computing time information,
gathered at the beginning of the runtime. We apply this algorithm to the NAS parallel benchmarks (NPB v3.3)~\cite{44}. Our experiments are executed using the simulator
predict both energy consumption and execution time over all available scaling
factors. The prediction achieved depends on some computing time information,
gathered at the beginning of the runtime. We apply this algorithm to the NAS parallel benchmarks (NPB v3.3)~\cite{44}. Our experiments are executed using the simulator
distributed memory architecture. Furthermore, we compare the proposed algorithm
with Rauber and Rünger methods~\cite{3}. The comparison's results show that our
algorithm gives better energy-time trade-off.
distributed memory architecture. Furthermore, we compare the proposed algorithm
with Rauber and Rünger methods~\cite{3}. The comparison's results show that our
algorithm gives better energy-time trade-off.
In this paper, we have presented a new online scaling factor selection method
that optimizes simultaneously the energy and performance of a distributed
In this paper, we have presented a new online scaling factor selection method
that optimizes simultaneously the energy and performance of a distributed
communication times measured at the first iteration to predict energy
consumption and the performance of the parallel application at every available
frequency. Then, it selects the scaling factor that gives the best trade-off
communication times measured at the first iteration to predict energy
consumption and the performance of the parallel application at every available
frequency. Then, it selects the scaling factor that gives the best trade-off