MétaCan
Menu
Back to cohort
Record W2401996179 · doi:10.1504/ijmheur.2015.074245

An iterated local search approach for carbon footprint optimisation in an intercloud environment

2015· article· en· W2401996179 on OpenAlexaff
Valerie Danielle Justafort, Ronald Beaubrun, Samuel Pierre

Bibliographic record

VenueInternational Journal of Metaheuristics · 2015
Typearticle
Languageen
FieldComputer Science
TopicCloud Computing and Resource Management
Canadian institutionsUniversité LavalPolytechnique Montréal
FundersAmerican Society of Heating, Refrigerating and Air-Conditioning Engineers
KeywordsComputer scienceCarbon footprintIterated local searchVirtual machineMathematical optimizationWorkloadReduction (mathematics)HeuristicIterated functionLocal search (optimization)AlgorithmMathematicsGreenhouse gasArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we address the problem of virtual machine (VM) placement in an InterCloud with regard to the reduction of the environmental impact of such environment. We propose a mathematical formulation based on a smart workload consolidation method and a cooling maximisation technique that considers the dynamic behaviour of the cooling fans. As the virtual machine placement problem (VMPP) is classified as an NP-hard problem, we propose an implementation of the iterated local search (ILS) algorithm, ILS_CBF, in order to find good solutions in a reasonable time. Computational results allow to identify the parameters that reduce the carbon footprint costs. The comparison of the proposed heuristic with the exact method and other algorithms demonstrate that the obtained costs are relatively close to the lower bounds, ranging from 0% to a maximum distance less than 2.6%, and allow a good tradeoff between the quality of the solution and the computational time.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.000

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.

Opus teacher head0.050
GPT teacher head0.299
Teacher spread0.248 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations1
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of MetaheuristicsSame topicCloud Computing and Resource ManagementFrench-language works237,207