Delay composition in preemptive and non-preemptive real-time pipelines
From MaRDI portal
Publication:842722
DOI10.1007/s11241-008-9056-3zbMath1180.68083OpenAlexW2123155769MaRDI QIDQ842722
Praveen Jayachandran, Tarek F. Abdelzaher
Publication date: 25 September 2009
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-008-9056-3
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (3)
Scheduling of computational processes in real-time distributed systems with uncertain task execution times ⋮ Memory-centric scheduling for multicore hard real-time systems ⋮ Reduction-based schedulability analysis of distributed systems with cycles in the task graph
Cites Work
- Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
- A calculus for network delay. II. Network analysis
- Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Delay composition in preemptive and non-preemptive real-time pipelines