MétaCan
Menu
Back to cohort
Record W4353072056 · doi:10.3390/en16062900

Optimized Hierarchical Tree Deep Convolutional Neural Network of a Tree-Based Workload Prediction Scheme for Enhancing Power Efficiency in Cloud Computing

2023· article· en· W4353072056 on OpenAlexaboutno aff
Vadim Bolshev, Siva Shankar Subramanian, Tulika Chakrabarti, Prąsun Chakrabarti, Владимир Панченко, Igor Yudaev, Yu. V. Daus

Bibliographic record

VenueEnergies · 2023
Typearticle
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceWorkloadCloud computingBenchmark (surveying)ScalabilityConvolutional neural networkData miningArtificial neural networkRedundancy (engineering)Data redundancyTree (set theory)Artificial intelligenceDatabaseOperating system

Abstract

fetched live from OpenAlex

Workload prediction is essential in cloud data centers (CDCs) for establishing scalability and resource elasticity. However, the workload prediction accuracy in the cloud data center could be better due to noise, redundancy, and low performance for workload prediction. This paper designs a hierarchical tree-based deep convolutional neural network (T-CNN) model with sheep flock optimization (SFO) to enhance CDCs’ power efficiency and workload prediction. The kernel method is used to preprocess historical information from the CDCs. Additionally, T-CNN model weight parameters are optimized using SFO. The suggested TCNN-SFO technology has successfully reduced excessive power consumption while correctly forecasting the incoming demand. Further, the proposed model is assessed using two benchmark datasets: Saskatchewan HTTP traces and NASA. The developed model is executed in a Java tool. Therefore, associated with existing methods, the developed technique has achieved higher accuracy of 20.75%, 19.06%, 29.09%, 23.8%, and 20.5%, as well as lower energy consumption of 20.84%, 18.03%, 28.64%, 30.72%, and 33.74% when validating the Saskatchewan HTTP traces dataset. It has also achieved higher accuracy of 32.95%, 12.05%, 32.65%, and 26.54%.

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 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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.450
Threshold uncertainty score0.799

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
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.014
GPT teacher head0.243
Teacher spread0.229 · 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 teacher head, 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

Citations23
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueEnergiesSame topicIoT and Edge/Fog ComputingFrench-language works237,207