MétaCan
Menu
Back to cohort
Record W2934871861 · doi:10.1109/hase.2019.00020

Isochronous Execution Models for High-Assurance Real-Time Systems

2019· article· en· W2934871861 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 scienceReal-time computing

Abstract

fetched live from OpenAlex

To counter the exorbitant cost of developing certifiable safety-critical software, we propose task execution models that realize an architectural mitigation-based approach to achieving high integrity and highly predictable safety-critical systems. Our premise is that high design assurance levels (DALs) for a software component may be achieved as follows: each system operation that needs a high assurance level will be handled by a software component that has high performance/quality-of-service on average, but built at a lower assurance level, and this component is “monitored” by one (or more) simple component(s) that is (are) predictable, may have lower QoS, but is (are) built at the highest assurance level. The components associated with a software function would run isochronously on separate processors. We present a suite of such isochronous allocation and scheduling problems with varying levels of generality, along with their solutions. We extend our results to the recurrent task model, where tasks should complete before their deadlines.

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 categoriesInsufficient payload (model declined to judge)
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.858
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.0000.000
Scholarly communication0.0000.002
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.011
GPT teacher head0.221
Teacher spread0.211 · 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

Citations1
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicReal-Time Systems SchedulingFrench-language works237,207