MétaCan
Menu
Back to cohort
Record W1938006996

Paradigm-based adaptive provisioning in virtualized data centers

2013· article· en· W1938006996 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

VenueIntegrated Network Management · 2013
Typearticle
Languageen
FieldComputer Science
TopicCloud Computing and Resource Management
Canadian institutionsUniversity of WaterlooUniversity of Toronto
Fundersnot available
KeywordsProvisioningComputer scienceCloud computingDistributed computingVirtualizationAllocatorSet (abstract data type)Virtual machineTask (project management)Computer networkOperating systemSystems engineering
DOInot available

Abstract

fetched live from OpenAlex

Virtualized data centers host multiple applications with distinct objectives in a shared infrastructure. Accommodating several dynamic applications in virtual data centers is a challenging task for cloud providers. Current provisioning solutions focus on a limited set of objectives that may not be suited for the increasing number of applications deployed in data centers everyday. In this paper we propose an adaptive provisioning architecture for virtualized data centers based on allocation paradigms. A paradigm translates high-level application goals to objectives, allocator instances, and actions that actually provision customized virtual infrastructures to applications. A paradigm policy language is defined to express the relationship between paradigms, objectives, and actions. A performance evaluation of the proposed approach considers four main aspects: acceptance ratio, provisioning cost, and CPU and link utilization. Simulation results show that our proposal is able to select the most appropriate set of allocation actions based on the particularities of the applications.

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 categoriesMeta-epidemiology (narrow)
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.906
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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0030.002
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.240
Teacher spread0.216 · 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