Scheduling hard real-time systems: a review
Software Engineering Journal - Special issue on real-time software
A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Analysis of hard real-time communications
Real-Time Systems
Engineering a hard real-time system: from theory to practice
Software—Practice & Experience
Real-Time Schedulability Tests for Preemptive Multitasking
WPDRTS Selected papers from the 4th workshop on Parallel and distributed real-time systems
Implementation of Hard Real-Time Embedded Control Systems
Real-Time Systems
On fixed priority scheduling, offsets and co-prime task periods
Information Processing Letters
Multiple process execution in cache related preemption delay analysis
Proceedings of the 4th ACM international conference on Embedded software
Worst-Case Response Time Analysis for OSEK/VDX Compliant Real-Time Distributed Control Systems
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Exact best-case end-to-end response time analysis for hard real-time distributed systems
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
End-to-end worst-case response time analysis for hard real-time distributed systems
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
| Hi-index | 0.00 |
A well-established approachto the verification of end-to-end response times for distributed,hard real-time systems is an integrated scheduling analysis ofboth task processing and message communication. Hitherto, publishedanalyses have been confined to the computation of worst-casebounds only and best-case response times have been ignored, assumedto be zero or treated approximately. However, there are compellingreasons for computing both upper and lower bounds on responsetimes, not only to allow the verification of best-case performancebut also to improve the accuracy of the overall analysis. Thispaper describes a precise best-case execution time analysis whichreduces jitter and extends distributed scheduling analysis toyield more accurate upper and lower bounds on system responsetimes. The analysis is combined with existing results for worst-caseresponses in a single scheduling algorithm to compute both upperand lower bounds on end-to-end response in distributed systems.A design tool has been developed to automatethe analysis and support the performance verification of diversereal-time systems composed of tasks executing on multiple processorswhich communicate using the Controller Area Network (CAN) fieldbus.