MétaCan
Menu
Back to cohort

MULTIPROCESSOR SCHEDULING IN SUPERVISORY CONTROL OF DISCRETE-EVENT SYSTEMS FRAMEWORK

2007· article· en· W1973686476 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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueControl and Intelligent Systems · 2007
Typearticle
Languageen
FieldComputer Science
TopicReal-Time Systems Scheduling
Canadian institutionsConcordia University
Fundersnot available
KeywordsMultiprocessingSupervisory controlComputer scienceScheduling (production processes)Parallel computingDistributed computingControl (management)Embedded systemEngineeringOperations managementArtificial intelligence

Abstract

fetched live from OpenAlex

We present a framework for designing schedulers for hard real-time systems upon uniform multiprocessors based on Supervisory Control Theory (SCT) for timed discrete-event systems (TDES). The contribution of this work lies in the development of a formal constructive method for controlling the preemptive and migrative execution of real-time tasks on a set of uniform processors. This approach allows a unified view of scheduling theory based on the timing analysis of models of real-time applications, i.e., the complications of checking schedulability and determining a scheduling algorithm are considered as dual problems: a solution to the former implies a solution to the latter and vice versa.

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.004
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.895
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
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.020
GPT teacher head0.264
Teacher spread0.244 · 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