MétaCan
Menu
Back to cohort

Empirical Bounds of Multicore Cache Interference for Real-Time Schedulability Analysis

2019· article· en· W3021177675 on OpenAlexaff
Srini Srinivasan, Russell Kegley, Mark A. Gerhardt, Rich Hilliard, Jonathan Preston, Clifford Granger, Steve Drager, Matthew Anderson, R.J. Rosa, Alan Charsagua, Rin Ha, Nithya Srinivasan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicReal-Time Systems Scheduling
Canadian institutionsLockheed Martin (Canada)
Fundersnot available
KeywordsComputer scienceMulti-core processorPredictabilityCacheWorst-case execution timeExecution timePreemptionEmbedded systemUpper and lower boundsScalabilityParallel computingDistributed computingOperating system

Abstract

fetched live from OpenAlex

Multicore processors offer significant advantages of weight, power, and space to embedded real-time developers, making their adoption almost inevitable. Also, system sustainability and economies of scale will increasingly make multicore devices indispensable. However, predictability of performance, specifically, establishing realistic upper bounds on execution time for schedulability analysis is a significant challenge to certification. This paper describes a methodology for empirically establishing a reasonable, high-confidence upper bound for cache interference effects in the context of engineering practices commonly used in certifiable real-time systems.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.020
metaresearch head score (Gemma)0.180
Version: metacan-v3-hybrid-931329e0061cValidation 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.020
Threshold uncertainty score0.107

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0200.180
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0020.002
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0020.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.028
GPT teacher head0.310
Teacher spread0.283 · 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 source (direct Gemma or distilled Codex), 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

Citations4
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicReal-Time Systems SchedulingFrench-language works237,207