Abstract Energy efficiency is one of the most critical aspects of modern computing paradigms due to minimizing carbon footprint and lowering operational costs. To achieve efficiency, the typical approach is to address the source of energy consumption and apply the appropriate strategies for energy savings. In this paper, based on an offloading framework for edge and cloud computing, we propose a comprehensive methodology that leverages predictive analysis and convex optimization techniques to achieve efficiency in power utilization. This methodology aimed to reduce the power consumption of edge/cloud computing clusters while maintaining an acceptable quality of service. The core idea was to enhance the historical data in the first place by using the prediction. This predictive historical data revealed the trend of computational resource allocation. Subsequently, the convex optimization technique coupled with the Deep Q-Network model was employed to formulate and schedule the distribution of the offloaded tasks. By engaging this combination, the offloading framework could produce a near-optimal and adaptive energy decision, which helps achieve energy efficiency. The experimental results showed that the proposed methodology could obtain significant energy savings while maintaining a suitable level of performance compared to other state-of-the-art approaches.

The number of applications based on Apache Hadoop is dramatically increasing due to the robustness and dynamic features of this system. At the heart of Apache Hadoop, the Hadoop Distributed File System (HDFS) provides the reliability and high availability for computation by applying a static replication by default. However, because of the characteristics of parallel operations on the application layer, the access rate for each data file in HDFS is completely different. Consequently, maintaining the same replication mechanism for every data file leads to detrimental effects on the performance. By rigorously considering the drawbacks of the HDFS replication, this paper proposes an approach to dynamically replicate the data file based on the predictive analysis. With the help of probability theory, the utilization of each data file can be predicted to create a corresponding replication strategy. Eventually, the popular files can be subsequently replicated according to their own access potentials. For the remaining low potential files, an erasure code is applied to maintain the reliability. Hence, our approach simultaneously improves the availability while keeping the reliability in comparison to the default scheme. Furthermore, the complexity reduction is applied to enhance the effectiveness of the prediction when dealing with Big Data.