Pages that link to "Item:Q1395688"
From MaRDI portal
The following pages link to Dynamic- and static-priority scheduling of recurring real-time tasks (Q1395688):
Displaying 27 items.
- Maintaining the feasibility of hard real-time systems with a reduced number of priority levels (Q326990) (← links)
- Feasibility analysis of real-time transactions (Q438201) (← links)
- Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917) (← links)
- Graph-based models for real-time workload: a survey (Q497995) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs (Q779456) (← links)
- Quantitative characterization of event streams in analysis of hard real-time applications (Q813133) (← links)
- The feasibility of general task systems with precedence constraints on multiprocessor platforms (Q842732) (← links)
- Cache-aware timing analysis of streaming applications (Q842736) (← links)
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks (Q880554) (← links)
- Combinatorial abstraction refinement for feasibility analysis of static priorities (Q892994) (← links)
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
- GPU-based acceleration of system-level design tasks (Q987745) (← links)
- A gravitational task model with arbitrary anchor points for target sensitive real-time applications (Q1039306) (← links)
- Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks (Q1640309) (← links)
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement (Q1698776) (← links)
- On non-preemptive scheduling of recurring tasks using inserted idle times (Q1891163) (← links)
- An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling (Q2364024) (← links)
- Static priority scheduling of event-triggered real-time embedded systems (Q2369888) (← links)
- Real-time scheduling for energy harvesting sensor nodes (Q2460205) (← links)
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems (Q2481261) (← links)
- Sensitivity analysis for fixed-priority real-time systems (Q2481262) (← links)
- Reflective online reconfiguration of real-time applications having tasks with static priorities (Q2835133) (← links)
- Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems (Q4589529) (← links)
- (Q4823923) (← links)
- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand (Q5089126) (← links)
- REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE (Q5249007) (← links)