A Method for Satisfying Asynchronous and Periodic Timing Requirements in Real-Time Embedded Systems
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.
Bibliographic record
Abstract
A method for satisfying asynchronous and periodic timing requirements in real-time embedded systems is presented. A guiding principle for this method is that it should exploit to a maximum extent any knowledge about system processes' characteristics that is available both before run-time and during run-time. The method consists of two phases: a pre-run-time phase and a run-time phase. In the pre-run-time phase, some of the asynchronous processes will be converted into new periodic processes while processor capacity will be reserved for all the remaining asynchronous processes. With the use of an optimal scheduling algorithm, the schedulability of the set of the new and original periodic processes will be determined, while the schedulability of all the asynchronous processes will be verified by checking their worst-case response times. In the run-time phase, asynchronous processes are scheduled for execution while guaranteeing that all the processes that have already been scheduled in the pre-run-time phase will always meet 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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it