MétaCan
Menu
Back to cohort
Record W2351542693

The Scheduling System In Distributed Realtime Embedded Middleware

2008· article· en· W2351542693 on OpenAlex
Duan Ai-qun

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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueMicrocomputer applications · 2008
Typearticle
Languageen
FieldComputer Science
TopicReal-Time Systems Scheduling
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceDistributed computingScheduling (production processes)Fair-share schedulingEarliest deadline first schedulingDynamic priority schedulingRound-robin schedulingTwo-level schedulingCommon Object Request Broker ArchitectureFixed-priority pre-emptive schedulingRate-monotonic schedulingOperating systemScheduleMathematical optimization
DOInot available

Abstract

fetched live from OpenAlex

The distributed scheduling system designed in this paper extends that of the Real-Time CORBA 1.2. It's able to get global information, so the local schedulers can get more accurate scheduling information. The local schedulers are assumed to use deadline algorithm, so the scheduling system make it harder for distributed task to lose deadline. If local schedulers use other algorithms, the scheduling system is able to give appropriate mechanisms. This paper aims to describe design and implementation of the scheduling system.

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: Methods · Consensus signal: none
Teacher disagreement score0.710
Threshold uncertainty score0.841

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.0010.000
Scholarly communication0.0000.000
Open science0.0020.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.014
GPT teacher head0.229
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