Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
Reads0
Chats0
TLDR
The original schedulability analysis given for CAN messages is flawed and the priority assignment policy, previously claimed to be optimal for CAN, is not in fact optimal and a method of obtaining an optimal priority ordering that is applicable to CAN is cited.Abstract:
Controller Area Network (CAN) is used extensively in automotive applications, with in excess of 400 million CAN enabled microcontrollers manufactured each year. In 1994 schedulability analysis was developed for CAN, showing how worst-case response times of CAN messages could be calculated and hence guarantees provided that message response times would not exceed their deadlines. This seminal research has been cited in over 200 subsequent papers and transferred to industry in the form of commercial CAN schedulability analysis tools. These tools have been used by a large number of major automotive manufacturers in the design of in-vehicle networks for a wide range of cars, millions of which have been manufactured during the last decade.
This paper shows that the original schedulability analysis given for CAN messages is flawed. It may provide guarantees for messages that will in fact miss their deadlines in the worst-case. This paper provides revised analysis resolving the problems with the original approach. Further, it highlights that the priority assignment policy, previously claimed to be optimal for CAN, is not in fact optimal and cites a method of obtaining an optimal priority ordering that is applicable to CAN. The paper discusses the possible impact on commercial CAN systems designed and developed using flawed schedulability analysis and makes recommendations for the revision of CAN schedulability analysis tools.read more
Citations
More filters
Journal ArticleDOI
Trends in Automotive Communication Systems
TL;DR: The context of in-vehicle embedded systems and, in particular, the requirements imposed on the communication systems are introduced and the current efforts of the automotive industry on middleware technologies are reviewed.
Mixed Criticality Systems - A Review
Alan Burns,Robert I. Davis +1 more
TL;DR: This review covers research on the topic of mixed criticality systems that has been published since Vestal’s 2007 paper and covers the period up to and including December 2015.
Journal ArticleDOI
Real-Time Wireless Sensor-Actuator Networks for Industrial Cyber-Physical Systems
Chenyang Lu,Abusayeed Saifullah,Bo Li,Mo Sha,Humberto Gonzalez,Dolvara Gunatilaka,Chengjie Wu,Lanshun Nie,Yixin Chen +8 more
TL;DR: A series of recent advances in real-time WSANs for industrial control systems are reviewed, with a focus on cyber-physical codesign of wireless control systems that integrate wireless and control designs.
Proceedings ArticleDOI
Static-Priority Scheduling over Wireless Networks with Multiple Broadcast Domains
TL;DR: A wireless medium access control protocol that provides static-priority scheduling of messages in a guaranteed collision-free manner, supports multiple broadcast domains, resolves the wireless hidden node problem and allows for parallel transmissions across a mesh network.
Patent
Configurable vehicle console
TL;DR: In this paper, a configurable vehicle console is defined as one or more displays that are capable of receiving input from a user, at least one of these displays may be removed from the console of a vehicle and operated as a stand-alone computing platform.
References
More filters
Book
Scheduling algorithms for multiprogramming in a hard real-time environment
C. L. Liu,James W. Layland +1 more
TL;DR: In this paper, the problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service, and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets.
Journal ArticleDOI
On the complexity of fixed-priority scheduling of periodic, real-time tasks
TL;DR: It is shown that the problem is NP-hard in all but one special case and the complexity of optimal fixed-priority scheduling algorithm is discussed.
Proceedings ArticleDOI
Fixed priority scheduling of periodic task sets with arbitrary deadlines
TL;DR: A general criterion for the schedulability of a fixed priority scheduling of period tasks with arbitrary deadlines is given and the results are shown to provide a basis for developing predictable distributed real-time systems.
Journal ArticleDOI
An extendible approach for analyzing fixed priority hard real-time tasks
TL;DR: This paper derives analysis for tasks with arbitrary deadlines that may suffer release jitter due to being dispatched by a tick driven scheduler, and considers bursty sporadic activities, where tasks arrive sporadically but then execute periodically for some bounded time.
Journal ArticleDOI
Calculating controller area network (can) message response times
TL;DR: This paper presents an analysis to bound accurately the worst-case response time of a given message, and a benchmark is used to illustrate the application of this analysis.