Deterministic Data Flow eliminates timing anomalies in cause-effect chain end-to-end latency with negligible average latency impact and a formal proof of the property.
Optimization of task allocation and priority assignment in hard real- time distributed systems.ACM Transactions on Embedded Computing Systems (TECS), 11(4):1–30
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scheduling Cause-Effect Chains without Timing Anomalies in End-to-End Latency
Deterministic Data Flow eliminates timing anomalies in cause-effect chain end-to-end latency with negligible average latency impact and a formal proof of the property.