Graph-based models for real-time workload: a survey
From MaRDI portal
Publication:497995
DOI10.1007/S11241-015-9234-ZzbMATH Open1337.68050OpenAlexW2107233055MaRDI QIDQ497995FDOQ497995
Authors: Martin Stigge, Wang Yi 
Publication date: 25 September 2015
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.705.3644
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
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- A theory of timed automata
- Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
- A survey of hard real-time scheduling for multiprocessor systems
- Scheduling Real-Time Mixed-Criticality Jobs
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Combinatorial abstraction refinement for feasibility analysis of static priorities
- A note on preemptive scheduling of periodic, real-time tasks
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Lectures on Concurrency and Petri Nets
- Hard real-time computing systems. Predictable scheduling algorithms and applications.
- Network calculus. A theory of deterministic queueing systems for the Internet
- Task automata: Schedulability, decidability and undecidability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Real time scheduling theory: A historical perspective
- Dynamic- and static-priority scheduling of recurring real-time tasks
- EDF-schedulability of synchronous periodic task systems is coNP-hard
- An optimal resource sharing protocol for generalized multiframe tasks
- Priority inheritance protocols: an approach to real-time synchronization
- Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
- Schedulability analysis of fixed-priority systems using timed automata
- The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
- Title not available (Why is that?)
Cited In (9)
- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
- Schedulability analysis of a graph-based task model for mixed-criticality systems
- Refinement of workload models for engine controllers by state space partitioning
- Beyond the weakly hard model: measuring the performance cost of deadline misses
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- 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
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
- Characterizations of parallel real-time workloads
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)
