Proceedings Real-Time Systems Symposium REAL-94 1994
DOI: 10.1109/real.1994.342710
|View full text |Cite
|
Sign up to set email alerts
|

Analysing real-time communications: controller area network (CAN)

Abstract: The

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
183
0
2

Year Published

1998
1998
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 299 publications
(187 citation statements)
references
References 5 publications
2
183
0
2
Order By: Relevance
“…The messages are actually transmitted according to the protocol specification of CAN. The classical scheduling analysis of CAN [27,13] which is recently extended for FIFO queues [14] assumes that the tasks queueing CAN messages are invoked either by periodic events with a period or sporadic events with a minimum inter-arrival time.…”
Section: Mixed Transmission Patterns Supported By High-level Protocolsmentioning
confidence: 99%
See 1 more Smart Citation
“…The messages are actually transmitted according to the protocol specification of CAN. The classical scheduling analysis of CAN [27,13] which is recently extended for FIFO queues [14] assumes that the tasks queueing CAN messages are invoked either by periodic events with a period or sporadic events with a minimum inter-arrival time.…”
Section: Mixed Transmission Patterns Supported By High-level Protocolsmentioning
confidence: 99%
“…RTA applies to systems (or networks) where tasks (or messages) are scheduled with respect to their priorities and which is the predominant scheduling technique used in real-time operating systems (or real-time network protocols, e.g., CAN) today [22]. [27,13] which is applicable to the CAN network where some nodes implement priority queues and some implement FIFO queues. However, the extended analysis in [14] does not support mixed messages.…”
Section: Introductionmentioning
confidence: 99%
“…By combining them and a previous result on schedulability analysis of the CAN bus [17] we obtain that the response time can be calculated as a sum of the waiting time w i and C i .…”
Section: Schedulability Analysismentioning
confidence: 81%
“…In this model, the exact time of a transmission request is unknown but a lower bound on the time between two consecutive transmission requests from the same message stream is known. This model is supported in processor scheduling [4] (where a message stream is called a task) and in wired communication channels [17]. Wireless communication is of increasing interest in the design of distributed real-time systems, and many scheduling algorithms and analysis techniques for wireless communication are available for periodic messages.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, several studies on the ability of fieldbus networks to cope with real-time requirements have been presented, such as [3] on CAN, [4] and [5] on FIP and finally [6] and [7] on Profibus.…”
Section: Introductionmentioning
confidence: 99%