MétaCan
Menu
Back to cohort
Record W2102938079 · doi:10.1109/pacrim.2009.5291233

Architectural support for greater predictability in real-time systems

2009· article· en· W2102938079 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicReal-Time Systems Scheduling
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer sciencePredictabilityCorrectnessScheduling (production processes)Processor schedulingWorst-case execution timeExecution timeArchitectureBranch predictorDistributed computingReal-time operating systemReal-time computingParallel computingEmbedded systemOperating systemProgramming language

Abstract

fetched live from OpenAlex

A real-time system is characterized by computational tasks that need to complete within well-defined time durations. Scheduling policies help guarantee deadlines, but scheduling policies and the analysis associated with them need exact information to guarantee timing correctness. This exact information includes the worst-case execution time of tasks in the system. Existing architecture techniques (caches, superscalar out-of-order execution) improve the average case performance of a computer system but complicate the estimation of worst-case execution times. In the talk I will discuss some recent techniques for estimating WCETs and some techniques for more predictable execution, including the use of scratchpad memories.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.767
Threshold uncertainty score0.652

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.0000.000
Scholarly communication0.0000.001
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.018
GPT teacher head0.259
Teacher spread0.241 · 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

Quick stats

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicReal-Time Systems SchedulingFrench-language works237,207