Simple and efficient duelist algorithm variations for energy-aware virtual machine placement in cloud data centers
Bibliographic record
Abstract
This research presents a novel approach to address the Virtual Machine Placement Problem (VMPP) in cloud data centers with the aim of minimizing energy consumption. The main contributions of this study are threefold. Firstly, a Duelist Algorithm specifically designed for VMPP, which introduces a unique concept of duelists combined with optimization techniques. The algorithm aims to strike a balance between exploration and exploitation in the search space, leading to more effective resource allocation and energy-efficient cloud data center management. Secondly, enhance the performance of the Duelist Algorithm by reducing the number of algorithm-specific parameters. This simplifies the implementation process and increases the algorithm's adaptability to various real-world problems, making it more user-friendly and robust. Lastly, conduct a comprehensive comparison of the Duelist Algorithm with the widely used Hybrid Harmony Search Algorithm (HS+SA+LS) in terms of energy consumption and overall efficiency. The experimental results demonstrate that the Duelist Algorithm consistently outperforms the Hybrid Harmony Search Algorithm, achieving remarkable improvements in both best and mean fitness values. Additionally, the Duelist Algorithm exhibits lower standard deviation values, indicating more stable and consistent performance. The findings of this research validate the effectiveness of the proposed Duelist Algorithm in minimizing energy consumption and optimizing cloud resource allocation. The reduction of algorithm-specific parameters further contributes to its versatility and simplicity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".