Paper Info
Title
Weakly hard real-time constraints on controller area network
Abstract
For priority based buses such as CAN, worst case response time analysis is able to determine whether messages always meet their deadlines. This can include system models with bounded network faults. However, the worst-case scenario (the critical instant) used by the analysis is extremely pessimistic compared to the rest of the invocations in the hyperperiod. We use weakly hard constraints to provide upper bounds on the maximum number of missed deadlines under fault conditions. By allowing some deadlines to be missed (around the critical instant) the weakly-hard schedulability of the system can be guaranteed at much higher levels of faults. This paper presents a response time based formulation that provides a guarantee on the weakly-hard schedulability of messages. Simulation results based on CAN and the Latest Send Time-CAN protocol show that because of the pessimism of the approach, in fact almost all messages meet their deadlines.
Year
DOI
Venue
2002
10.1109/EMRTS.2002.1019193
ECRTS
Keywords
Field
DocType
controller area networks,fault tolerant computing,protocols,real-time systems,CAN,Latest Send Time CAN protocol,bounded network faults,controller area network,fault conditions,message deadlines,missed deadlines,pessimism,priority based buses,system models,upper bounds,weakly hard real-time constraints,weakly-hard schedulability,worst case response time analysis
CAN bus,Worst case response time,Instant,Upper and lower bounds,Computer science,Response time,Real-time computing,Bandwidth (signal processing),Sampling (statistics),Bounded function,Distributed computing
Conference
ISSN
ISBN
Citations 
1068-3070
0-7695-1665-3
10
PageRank 
References 
Authors
0.83
8
3
Name
Order
Citations
PageRank
I. Broster115510.40
G. Bernat2523.66
A Burns35034375.85