Computing periodic request functions to speed-up the analysis of non-cyclic task models
From MaRDI portal
Publication:495917
DOI10.1007/s11241-014-9209-5zbMath1338.68042OpenAlexW2004926808MaRDI QIDQ495917
Publication date: 16 September 2015
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-014-9209-5
Related Items (2)
Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement ⋮ A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
Uses Software
Cites Work
- Unnamed Item
- New transience bounds for max-plus linear systems
- Combinatorial abstraction refinement for feasibility analysis of static priorities
- Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
- A characterization of the minimum cycle mean in a digraph
- Dynamic- and static-priority scheduling of recurring real-time tasks
- Linear matrix period in max-plus algebra
- Multi-core real-time scheduling for generalized parallel task models
- Generalized matrix period in max-plus algebra
- Computing a graph's period quadratically by node condensation
- Task automata: Schedulability, decidability and undecidability
- Transience Bounds for Long Walks
- Computational Complexity of Nachtigall's Representation
- Depth-First Search and Linear Graph Algorithms
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Faster parametric shortest path and minimum‐balance algorithms
- Polynomial algorithm for linear matrix period in max-plus algebra
This page was built for publication: Computing periodic request functions to speed-up the analysis of non-cyclic task models
