MétaCan
Menu
Back to cohort
Record W4291972664 · doi:10.1145/3555315

Formally Verified Scalable Look Ahead Planning For Cloud Resource Management

2022· article· en· W4291972664 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

VenueACM Transactions on Autonomous and Adaptive Systems · 2022
Typearticle
Languageen
FieldComputer Science
TopicCloud Computing and Resource Management
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceCloud computingScalabilityDistributed computingLivenessService-level agreementService levelElasticity (physics)ComputationFlexibility (engineering)Operating system

Abstract

fetched live from OpenAlex

In this article, we propose and implement a distributed autonomic manager that maintains service level agreements (SLA) for each application scenario. The proposed autonomic manager supports SLAs by configuring the bandwidth ratios for each application scenario and uses an overlay network as an infrastructure. The most important aspect of the proposed autonomic manager is its scalability which allows us to deal with geographically distributed cloud-based applications and a large volume of computation. This can be useful in look ahead optimization and in adaptations using complex models, such as machine learning. We formally prove the safety and liveness properties of the implemented distributed algorithms. Through experiments on the Amazon AWS cloud, using two different use cases, we demonstrate the elasticity and flexibility of the autonomic manager as a measure of its applicability to different cloud applications with different types of workloads. Experiments also demonstrate that increasing the size of a look ahead window, up to a certain size, improves the accuracy of the adaptation decisions by up to 50%.

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 categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.964
Threshold uncertainty score1.000

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.0010.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.024
GPT teacher head0.235
Teacher spread0.210 · 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