Reduction-based schedulability analysis of distributed systems with cycles in the task graph
From MaRDI portal
(Redirected from Publication:993510)
Recommendations
- Computing periodic request functions to speed-up the analysis of non-cyclic task models
- Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
- Delay composition in preemptive and non-preemptive real-time pipelines
- Improving the accuracy of scheduling analysis applied to distributed systems computing minimal response times and reducing jitter
- scientific article; zbMATH DE number 495275
Cites work
- A calculus for network delay. I. Network elements in isolation
- A calculus for network delay. II. Network analysis
- Delay composition in preemptive and non-preemptive real-time pipelines
- Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
- Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
- Quantitative characterization of event streams in analysis of hard real-time applications
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(2)
This page was built for publication: Reduction-based schedulability analysis of distributed systems with cycles in the task graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993510)