2026· Euromicro Conference on Real-Time Systems· Vol 12, pp. 7:1-7:5· 0 citations· 30 references
Computer Science
TL;DR
CacheFlow is presented, a framework that formulates total CRPD as a maximum-flow problem, and an iterative max-flow formulation is described to more efficiently integrate the max-flow solving in the context of standard fixed-priority response-time analysis.
This paper introduces a job-level dynamic cache allocation strategy for multicore systems in which critical real-time tasks execute on a dedicated core while sharing the LLC with best-effort workloads executing on the remaining cores.
PCG ∗ is introduced, an optimal TL-plane algorithm based on PCG, which guarantees at most 2( m − 1) preemptions per TL-plane, matching the best-known theoretical bound for uniform platforms.
Yahya Hamdani, P. Richard, A. Bertout et al.· Euromicro Conference on Real...· 0 citations
This paper compares FP and EDF scheduling algorithms in the presence of CRPD using the state-of-the-art CRPD analysis and finds that when CRPD is accounted for, the performance gains by EDF over FP, while still notable, are diminished.
Will Lunniss, S. Altmeyer, Robert Davis· 1 citation
The results show that soft SLO limits reduce corrective rescheduling actions by 49% compared to hard-limit approaches while maintaining acceptable performance guarantees, and resource-aware scheduling decreases node-level congestion and further mitigates SLO violations, demonstrating the effectiveness of incorporating...
Oliver Larsson, Thijs Metsch, Cristian Klein et al.· 0 citations
The automated design of heterogeneous embedded systems faces a fundamental challenge: bridging the gap between stochastic latency induced by resource contention and the deterministic requirements of real-time constraints. To address this, we propose a Hybrid Stochastic-Deterministic Modeling framework for contention-aw...
Shao Deng, Shanzhu Xiao, Huamin Tao et al.· IEEE Transactions on Automat...· 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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
