Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
From MaRDI portal
Publication:1698773
DOI10.1007/s11241-017-9282-7zbMath1426.68028OpenAlexW2720093539MaRDI QIDQ1698773
Werner Grass, Thi Huyen Chau Nguyen
Publication date: 16 February 2018
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-017-9282-7
Cites Work
- Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
- Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
- Measuring the performance of schedulability tests
- Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
- Approximation techniques for response-time analysis of static-priority tasks
- An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation
- Analysis and Design of Real-Time Servers for Control Applications
- Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
- Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
- A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
- Priority inheritance protocols: an approach to real-time synchronization
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Improved response-time bounds in fixed priority scheduling with arbitrary deadlines