Dynamic- and static-priority scheduling of recurring real-time tasks
From MaRDI portal
Recommendations
Cited in
(28)- A gravitational task model with arbitrary anchor points for target sensitive real-time applications
- Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
- On non-preemptive scheduling of recurring tasks using inserted idle times
- An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling
- Static priority scheduling of event-triggered real-time embedded systems
- Real-time scheduling for energy harvesting sensor nodes
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
- Sensitivity analysis for fixed-priority real-time systems
- Reflective online reconfiguration of real-time applications having tasks with static priorities
- Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
- A dynamic scheduling algorithm based on limited number of priority
- Feasibility analysis of real-time transactions
- Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
- scientific article; zbMATH DE number 2112421 (Why is no real title available?)
- Computing periodic request functions to speed-up the analysis of non-cyclic task models
- Graph-based models for real-time workload: a survey
- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
- REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
- Feasibility problems for recurring tasks on one processor
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
- Quantitative characterization of event streams in analysis of hard real-time applications
- The feasibility of general task systems with precedence constraints on multiprocessor platforms
- Cache-aware timing analysis of streaming applications
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks
- Combinatorial abstraction refinement for feasibility analysis of static priorities
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- GPU-based acceleration of system-level design tasks
This page was built for publication: Dynamic- and static-priority scheduling of recurring real-time tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395688)
