.png){kind=icon}
.png){kind=icon}
Return
HELIOS: Lightweight real-time scheduling with energy readiness guarantees
.png){kind=icon}
OA
AI
R
T
S
L
F
DOI：10.1016/j.sysarc.2026.103885.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Energy-harvesting embedded systems, like sensors and medical implants, must satisfy real-time constraints under strict energy limitations. Traditional schedulers, which prioritize timing over energy, often fail to produce valid schedules, particularly for non-preemptive task models. We introduce HELIOS, a lightweight, table-driven scheduler that treats timing and energy as joint first-class constraints while supporting limited-preemptive execution. HELIOS introduces energy readiness, ensuring jobs execute only when both temporal and energy conditions are met. The scheduling problem is formulated as an integer linear programming (ILP) problem, jointly optimizing task ordering, preemption points, and execution under energy constraints. By leveraging non-preemption and energy readiness, HELIOS maintains complexity proportional to job count. A key innovation is the use of worst-case energy footprints to guarantee safe execution via an energy readiness threshold. The table-driven runtime ensures compatibility with resource-constrained kernels. Experiments demonstrate that HELIOS achieves higher schedulability than priority-based baselines.
Keywords:
Real-time systems
Energy-harvesting
Task scheduling
Uniprocessor
Integer linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
2.9K
Citations:
4.2K
Organization
Cited Papers