Extending resources for avoiding overloads of mixed‐criticality tasks in cyber‐physical 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
With the increasing number of services and industries including nuclear, chemical, aerospace, and automotive sectors in cyber‐physical systems (CPSs), systems are being severely overloaded. CPSs comprises mixed‐critical tasks which are of either safety‐critical (high) or non‐safety critical (low). In traditional task scheduling, most of the existing scheduling algorithms provide poor performance for high‐criticality tasks when the system experiences overload and do not show explicit separation among different criticality tasks to take advantage of using cloud resources. Here, we propose a framework to schedule the mixed‐criticality tasks by analyzing their deadlines and execution times which leverage the performance of parallel processing through OpenMP. The proposed framework introduces a machine learning‐based prediction for a task offloading in the cloud. Moreover, it illustrates to execute a selected number of low‐criticality tasks in the cloud while the high‐criticality tasks are run on the local processors during the system overload. As a result, the high‐criticality tasks meet all their deadlines and the system achieves a significant improvement in the overall execution time and better throughput. In addition, the experimental results employing OpenMP show the effectiveness of using the partitioned scheduling over the global scheduling method upon multiprocessor systems to achieve the tasks isolation.
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.003 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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