Pages that link to "Item:Q495917"
From MaRDI portal
The following pages link to Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917):
Displaying 3 items.
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs (Q779456) (← links)
- Reduction-based schedulability analysis of distributed systems with cycles in the task graph (Q993510) (← links)
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement (Q1698776) (← links)