CALCULATING CONTROLLER AREA NETWORK (CAN) MESSAGE RESPONSE-TIMES

K Tindell; A Burns; A J Wellings

doi:10.1016/0967-0661(95)00112-8

CALCULATING CONTROLLER AREA NETWORK (CAN) MESSAGE RESPONSE-TIMES

K Tindell, A Burns, A J Wellings

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Controller Area Network (CAN) is a well-designed communications bus for sending and receiving short real-time control messages at speeds of up to 1Mbit/sec. One of the perceived drawbacks to CAN has been the inability to bound accurately the worst-case response time of a given message (i.e., the longest time between queueing the message and the message arriving at the destination processors). This paper presents an analysis to bound such latencies. A benchmark is used to illustrate the application of this analysis.

Original language	English
Pages (from-to)	1163-1169
Number of pages	7
Journal	Control engineering practice
Volume	3
Issue number	8
DOIs	https://doi.org/10.1016/0967-0661(95)00112-8
Publication status	Published - Aug 1995

Keywords

REAL-TIME SYSTEMS
REAL-TIME COMMUNICATIONS
SCHEDULING THEORY
SCHEDULING ANALYSIS
DISTRIBUTED SYSTEMS

Access to Document

10.1016/0967-0661(95)00112-8

http://www.sciencedirect.com/science/article/pii/0967066195001128

Cite this

@article{b04e48d3442d497bbbc6c686c59d51b1,

title = "CALCULATING CONTROLLER AREA NETWORK (CAN) MESSAGE RESPONSE-TIMES",

abstract = "Controller Area Network (CAN) is a well-designed communications bus for sending and receiving short real-time control messages at speeds of up to 1Mbit/sec. One of the perceived drawbacks to CAN has been the inability to bound accurately the worst-case response time of a given message (i.e., the longest time between queueing the message and the message arriving at the destination processors). This paper presents an analysis to bound such latencies. A benchmark is used to illustrate the application of this analysis.",

keywords = "REAL-TIME SYSTEMS, REAL-TIME COMMUNICATIONS, SCHEDULING THEORY, SCHEDULING ANALYSIS, DISTRIBUTED SYSTEMS",

author = "K Tindell and A Burns and Wellings, {A J}",

year = "1995",

month = aug,

doi = "10.1016/0967-0661(95)00112-8",

language = "English",

volume = "3",

pages = "1163--1169",

journal = "Control engineering practice",

issn = "0967-0661",

publisher = "Elsevier",

number = "8",

}

TY - JOUR

T1 - CALCULATING CONTROLLER AREA NETWORK (CAN) MESSAGE RESPONSE-TIMES

AU - Tindell, K

AU - Burns, A

AU - Wellings, A J

PY - 1995/8

Y1 - 1995/8

N2 - Controller Area Network (CAN) is a well-designed communications bus for sending and receiving short real-time control messages at speeds of up to 1Mbit/sec. One of the perceived drawbacks to CAN has been the inability to bound accurately the worst-case response time of a given message (i.e., the longest time between queueing the message and the message arriving at the destination processors). This paper presents an analysis to bound such latencies. A benchmark is used to illustrate the application of this analysis.

AB - Controller Area Network (CAN) is a well-designed communications bus for sending and receiving short real-time control messages at speeds of up to 1Mbit/sec. One of the perceived drawbacks to CAN has been the inability to bound accurately the worst-case response time of a given message (i.e., the longest time between queueing the message and the message arriving at the destination processors). This paper presents an analysis to bound such latencies. A benchmark is used to illustrate the application of this analysis.

KW - REAL-TIME SYSTEMS

KW - REAL-TIME COMMUNICATIONS

KW - SCHEDULING THEORY

KW - SCHEDULING ANALYSIS

KW - DISTRIBUTED SYSTEMS

U2 - 10.1016/0967-0661(95)00112-8

DO - 10.1016/0967-0661(95)00112-8

M3 - Article

SN - 0967-0661

VL - 3

SP - 1163

EP - 1169

JO - Control engineering practice

JF - Control engineering practice

IS - 8

ER -