Hybrid DVFS Scheduling for Real-Time Systems Based on Reinforcement Learning
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
Power consumption is one of the most challenging issues in the design of modern computing systems. In any computational device, processor consumes significant amount of power compared with other components. In order to reduce power consumption, dynamic voltage and frequency scaling (DVFS) has been commonly used in modern processors. In recent years, there has been much research on real-time DVFS techniques. These techniques work with different strategies and perform well under different conditions. However, a single algorithm is not always optimal under different workloads, dynamic slacks, and power settings. Furthermore, the variation in device configuration also affects the suitability of a given DVFS algorithm. Aiming for adaptability, in this paper, we propose a novel reinforcement learning-based approach, which takes a set of existing techniques, specialized to handle different conditions, and switches to the most suitable one in various situations. Experimental results show that the proposed hybrid approach saves more energy than any single policy executing individually.
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.000 |
| 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