Jul 2026· International Conference on Control, Decision and Information Technologies· pp. 3292-3297· 0 citations· 15 references
Abstract
Temporal predictability in real-time preemptive embedded systems is strongly influenced by how execution contexts are interrupted and resumed. This paper investigates whether hardware-assisted context preservation can reduce the temporal jitter introduced by conventional task switching in a RISC-V real-time execution model. A controlled comparative evaluation is performed between a standard shared-pipeline execution configuration and a context-preserving multi-context execution configuration under identical scheduler-driven periodic workloads. The study focuses on determinism-oriented task switching indicators, including deadline misses, preemption counts, switch-related flush events, and accumulated switch overhead. Four control-oriented experimental scenarios are used to expose progressively different switching conditions, ranging from baseline periodic execution to frequent preemption, near-saturation behavior, and tight-deadline pressure. The results show that preserving execution context across preemptions consistently reduces switching overhead and improves deadline-related behavior under recurring real-time activations. The benefits of context-preserving execution become progressively more visible under elevated preemption pressure, reduced timing slack, and tighter deadline conditions. The study therefore provides a controlled comparative basis for analyzing deterministic task switching in RISC-V real-time execution models.
As RISC-V processors are increasingly considered for embedded real-time and control-oriented systems, evaluating how timing behavior changes under increasing task concurrency becomes essential. Adding runnable tasks can amplify preemptions, context-switch activity, response-time variability, execution jitter, and deadl...
Nicolai Iuga, N. Găitan, I. Zagan et al.· De Computis· 0 citations
A retention-oriented scheduling framework for always-on arbitrary-deadline Directed Acyclic Graph workloads, consisting of two algorithms with a clear progression, and shows that, compared with a representative work-conserving baseline with automatic retention/PG, PREHS reduces static energy consumption.
Xiangzhen Xiao, Weijie Wang, Wei-Chen Liu et al.· ACM Transactions on Embedded...· 0 citations
The correct and timely execution of complex workloads in distributed systems relies on effective task scheduling mechanisms. This paper examines scheduling strategies for pipeline workflow applications coexisting with mixed-criticality periodic real-time tasks that exhibit heterogeneous laxity constraints. These real-t...
H. Karatza· International Conference on...· 0 citations
Experimental results validate that VCSRT achieves substantial reductions in worst-case allocation latency and worst-case execution time of high-priority tasks under heavy load, and maintains microsecond-level response jitter stability across all load levels.
Xin-Kai Zhang, W. Dai· Discover Computing· 0 citations
TIDE enables runtime adaptation of both parameters and instruction structure while preserving deterministic service of committed quantum-control events, an FPGA quantum-control processor that separates a runtime-revisable future from a hardware-timed committed-event stream.
The design and evaluation of FreeRTOS on custom 8-stage RV32/RV64 RISC-V soft processors with machine-mode CSRs, a CLINT timer, trap and exception control logic, and the required context-switch path are presented.
Hyun-Inn Kang, Geonwoo Yu, Jongwon Kim et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.