Uniprocessor scheduling of real-time synchronous dataflow tasks
From MaRDI portal
Recommendations
- Applying real-time scheduling theory to the synchronous data flow model of computation
- Static optimal scheduling for synchronous data flow graphs with model checking
- scientific article; zbMATH DE number 918595
- Parallelizing synchronous data-flow graphs via retiming
- Self-timed scheduling analysis for real-time applications
Cites work
- Applying real-time scheduling theory to the synchronous data flow model of computation
- Schedulability Analysis for Real-Time Systems with EDF Scheduling
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
Cited in
(10)- SPT is optimally competitive for uniprocessor flow
- Analysis of dataflow programs with interval-limited data-rates
- Parallelizing synchronous data-flow graphs via retiming
- Performance model checking scenario-aware dataflow
- Applying real-time scheduling theory to the synchronous data flow model of computation
- Graph-based models for real-time workload: a survey
- Worst-case throughput analysis for parametric rate and parametric actor execution time scenario-aware dataflow graphs
- Static optimal scheduling for synchronous data flow graphs with model checking
- Real-time uniprocessor scheduling with fewer preemptions
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
This page was built for publication: Uniprocessor scheduling of real-time synchronous dataflow tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777061)