MétaCan
Menu
Back to cohort
Record W1707396638 · doi:10.5555/2147671.2147748

A trace-based service level planning framework for enterprise application clouds

2011· article· en· W1707396638 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

VenueConference on Network and Service Management · 2011
Typearticle
Languageen
FieldComputer Science
TopicCloud Computing and Resource Management
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsBurstinessWorkloadCloud computingComputer scienceScalabilityTRACE (psycholinguistics)ExploitDistributed computingService (business)Service levelData scienceDatabaseComputer networkComputer securityOperating system

Abstract

fetched live from OpenAlex

As enterprises increasingly adopt the cloud paradigm, there is a need for tools that can help cloud service providers (SPs) decide on service level agreements with customers. Existing approaches have not considered several important challenges such as workload burstiness, workload uncertainty, and scalability that need to be addressed to realize such tools. This paper describes a trace-based framework developed to consider these issues. We present simulation experiments that show that our framework is scalable and provides more accurate planning insights to SPs than those that ignore complex workload behaviour such as burstiness. Furthermore, the results also illustrate how SPs can exploit our framework to assess the risks of workload uncertainty.

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.000
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.903
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.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.076
GPT teacher head0.270
Teacher spread0.194 · 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