Reduction-based schedulability analysis of distributed systems with cycles in the task graph
DOI10.1007/S11241-010-9098-1zbMATH Open1204.68039OpenAlexW2155837078MaRDI QIDQ993510FDOQ993510
Authors: Praveen Jayachandran, Tarek Abdelzaher 
Publication date: 20 September 2010
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-010-9098-1
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
schedulability analysisend-to-end delaynon-acyclic systemsproblem reductionreal-time distributed system
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- 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
- Quantitative characterization of event streams in analysis of hard real-time applications
- Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
- Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
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)
