Answers are grounded in this paper and cite their sources.
Volunteer Cloud computing, like traditional Cloud computing, has gained significant importance due to its ability to harness resources from individual personal machines, contributed voluntarily by their owners. In this paradigm, personal machine resources are shared voluntarily by their owners. This approach is particularly valuable for handling data‐intensive computations and storing Big Data. However, managing the potential unavailability of volunteer machines is crucial. Additionally, in Volunteer Cloud environments, energy consumption is becoming increasingly significant alongside execution time and cost. However, optimizing energy consumption remains a critical challenge, particularly in environments with dynamic and unpredictable availability of volunteer resources. This paper investigates the problem of energy‐efficient services placement in Volunteer Cloud environments. Specifically, we address the challenge of optimally deploying and running independent applications to minimize energy consumption while ensuring that physical machines are not overloaded and avoiding redundant deployments on the same machine. We propose two heuristic strategies to tackle this problem: the Dynamic Shortest Path Strategy (D‐SPS‐VC) for dynamic service placement and the Static Shortest Path Strategy (S‐SPS‐VC) for static service placement. These strategies are designed to optimize energy efficiency by considering constraints such as machine availability, capacity, and application duplication. The main contribution of this study is the development of these heuristic strategies, which are validated through a series of experiments that demonstrate their effectiveness in reducing energy consumption in Volunteer Cloud environments.
No takes yet. Share an insight, caveat, or question.
Maaouia et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: