mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Reducing Pessimism and Increasing Flexibility in the Controller Area Network
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-6132-7945
2003 (English)Licentiate thesis, monograph (Other scientific)
Abstract [en]

The Controller Area Network (CAN) is a widely used real-time communication network for automotive and other embedded applications. As new applications continue to evolve, the complexity of distributed CAN based systems increase. However, CAN's maximum speed of 1 Mbps remains fixed, leading to performance bottlenecks. In order to make full use of this scarce bandwidth, methods for increasing the achievable utilisation are needed. Traditionally, real-time scheduling theory has targeted hard real-time systems, which most of the time are safety critical. Since these systems (by definition) are not allowed to have any timing flaws, analysis techniques need to take all possible scenarios of execution combinations and execution times of the system into consideration. This will result in a system that is configured for the worst possible scenario. Whether this scenario is likely, or even possible, in the real system is not considered. Hence, the result may be an unnecessarily expensive system, with potentially overly provisioned resources. In this thesis we address two issues. In the first part, we investigate how to loosen up pessimistic real-time analysis in a controlled way, thereby allowing the designer to make well-founded trade-offs between the level of real-time guarantee and the system cost. Specifically, we investigate and model the bit-stuffing mechanism in CAN in order to retrieve representative distributions of stuff-bits, which we then use in the response time analysis instead of the worst-case values normally used. We evaluate the validity of these stuff-bit distributions in two case studies, and we integrate this representation of message frame length with the classical CAN worst-case response-time analysis. In the second part of the thesis, we propose a novel way of scheduling the CAN. By providing server-based scheduling, bandwidth isolation between users is guaranteed. This increases the flexibility of CAN, by providing efficient handling of sporadic and aperiodic message streams. Server-based scheduling also has the potential to allow higher network utilisation compared to CAN's native scheduling. The performance and properties of server-based scheduling of CAN is evaluated using simulation. Also, the server-based scheduling is applied in an end-to-end analysis. Keywords: controller area network, CAN, real-time communication, real-time analysis, reliability trade-off analysis, bit-stuffing, server-based scheduling

Place, publisher, year, edition, pages
2003.
Identifiers
URN: urn:nbn:se:mdh:diva-2053OAI: oai:DiVA.org:mdh-2053DiVA, id: diva2:114716
Note
Presentation Monday 12th of May 2003.Available from: 2008-11-11 Created: 2008-11-11 Last updated: 2013-12-03

Open Access in DiVA

No full text in DiVA

Authority records BETA

Nolte, Thomas

Search in DiVA

By author/editor
Nolte, Thomas
By organisation
Department of Computer Science and Electronics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 34 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf