A deterministic scheduling algorithm for tasks in car networks outperforms shortest-path and min-time methods in meeting deadlines and balancing load across wired and hybrid wireless topologies.
The next step in E/E architectures
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic Task Scheduling in In-Vehicle Networks for Software-Defined Vehicles
A deterministic scheduling algorithm for tasks in car networks outperforms shortest-path and min-time methods in meeting deadlines and balancing load across wired and hybrid wireless topologies.