Graph-based models for real-time workload: a survey
From MaRDI portal
Recommendations
- Schedulability analysis of a graph-based task model for mixed-criticality systems
- Applying real-time scheduling theory to the synchronous data flow model of computation
- A survey of real-time scheduling on multiprocessor systems
- Uniprocessor scheduling of real-time synchronous dataflow tasks
- Multiprocessor scheduling for real-time systems
Cites work
- scientific article; zbMATH DE number 2080041 (Why is no real title available?)
- scientific article; zbMATH DE number 2080067 (Why is no real title available?)
- scientific article; zbMATH DE number 1830720 (Why is no real title available?)
- A note on preemptive scheduling of periodic, real-time tasks
- A survey of hard real-time scheduling for multiprocessor systems
- A theory of timed automata
- An optimal resource sharing protocol for generalized multiframe tasks
- Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
- Combinatorial abstraction refinement for feasibility analysis of static priorities
- Dynamic- and static-priority scheduling of recurring real-time tasks
- EDF-schedulability of synchronous periodic task systems is coNP-hard
- Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
- Hard real-time computing systems. Predictable scheduling algorithms and applications.
- Lectures on Concurrency and Petri Nets
- Network calculus. A theory of deterministic queueing systems for the Internet
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Priority inheritance protocols: an approach to real-time synchronization
- Real time scheduling theory: A historical perspective
- Schedulability analysis of fixed-priority systems using timed automata
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Scheduling Real-Time Mixed-Criticality Jobs
- Task automata: Schedulability, decidability and undecidability
- The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
Cited in
(9)- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
- Refinement of workload models for engine controllers by state space partitioning
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
- A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War
- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Beyond the weakly hard model: measuring the performance cost of deadline misses
- Characterizations of parallel real-time workloads
- Schedulability analysis of a graph-based task model for mixed-criticality systems
This page was built for publication: Graph-based models for real-time workload: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497995)
