Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Probabilistic timing analysis: An approach using copulas
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
ACM Transactions on Embedded Computing Systems (TECS)
Robust priority assignment for messages on Controller Area Network (CAN)
Real-Time Systems
Failure-dependent execution time analysis
Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS
Reliability analysis for MPSoCs with mixed-critical, hard real-time constraints
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Embedded Systems Design
Embedded Systems Design
Stochastic response-time guarantee for non-preemptive, fixed-priority scheduling under errors
Proceedings of the 50th Annual Design Automation Conference
Probabilistic response time bound for CAN messages with arbitrary deadlines
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Building timing predictable embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Hi-index | 0.00 |
As CAN (Controller Area Network) is increasingly used in safety-critical applications, there is a need for accurate predictions of failure probability. In this paper we provide a general probabilistic schedulability analysis technique which is applied specifically to CAN to determine the effect of random network faults on the response times of messages. The resultant probability distribution of response times can be used to provide probabilistic guarantees of real-time behaviour in the presence of faults. The analysis is designed to have as little pessimism as possible but never be optimistic. Through simulations, this is shown to be the case. It is easy to apply and can provide useful evidence for justification of an event-triggered bus in a critical system.