MétaCan
Menu
Back to cohort
Record W2249198112 · doi:10.1109/cscloud.2015.82

Using ELM Techniques to Predict Data Centre VM Requests

2015· article· en· W2249198112 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and ELM
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceCluster analysisExtreme learning machineFeature (linguistics)Resource allocationData miningData modelingMachine learningDatabaseArtificial neural network

Abstract

fetched live from OpenAlex

Data centre prediction models can be used to forecast future loads for a given centre in terms of CPU, memory, VM requests, and other parameters. An effective and efficient model can not only be used to optimize resource allocation, but can also be used as part of a strategy to conserve energy, improve performance and increase profits for both clients and service providers. In this paper, we have developed a prediction model, which combines k-means clustering techniques and Extreme Learning Machines (ELMs). We have shown the effectiveness of our proposed model by using it to estimate future VM requests in a data centre based on its historical usage. We have tested our model on real Google traces that feature over 25 million tasks collected over a 29-day time period. Experimental results presented show that our proposed system outperforms other models reported in the literature.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.491
Threshold uncertainty score0.287

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.117
GPT teacher head0.357
Teacher spread0.240 · 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

Quick stats

Citations26
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and ELMFrench-language works237,207