Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited and Revised
Robert Davis, Alan Burns, Reinder Bril and Johan Lukkien
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 over the last 8 years. 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.
Download Not Available
BibTex Entry
@techreport{Davis2006a,
author = {Robert Davis and Alan Burns and Reinder Bril and Johan Lukkien},
institution = {Compuer Science Dept., University of York},
month = {September},
number = {YCS-2006-408},
title = {Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited and Revised},
year = {2006}
}