Scheduling the CAN bus with earliest deadline techniques

被引:29
作者
Di Natale, M [1 ]
机构
[1] Univ Pisa, I-56100 Pisa, Italy
来源
21ST IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS | 2000年
关键词
D O I
10.1109/REAL.2000.896015
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Controller Area Network (CAN) is widely used in real-time automobile control and is gaining wider acceptance as a standard for factory automation. This paper discusses the applicability of Earliest Deadline (EDF) techniques to the scheduling of CAN messages. Earliest deadline can guarantee higher network utilization than fixed-priority schemes like Deadline or Rate Monotonic (DM, RM), but it is difficult to implement in local area networks or focal buses. The reason is the need for updating the deadlines (priorities) at each scheduling round and the limited numer of priority levels offered by the arbitration protocol. This deadline encoding problem results in an additional priority inversion factor when considering the schedulability analysis of hard real-time messages. This paper describes an effective deadline encoding method and discusses its implementation and its effects on the guarantee analysis. In spite of a limited processor overhead (less than 5% of CPU time) the proposed EDF implementation allows a increase (up to 20%); in the feasible network workload. This trade off will be made more convenient as controller technology evolves.
引用
收藏
页码:259 / 268
页数:10
相关论文
共 17 条
[1]  
AUDSLEY N, 1993, SOFTWARE ENG J SEP
[2]   STACK-BASED SCHEDULING OF REALTIME PROCESSES [J].
BAKER, TP .
REAL-TIME SYSTEMS, 1991, 3 (01) :67-99
[3]  
Bosch Global, 1991, CAN SPEC VERS 2 0
[4]  
ISO, 1993, ISO 11898
[5]   FIXED PRIORITY SCHEDULING WITH LIMITED PRIORITY LEVELS [J].
KATCHER, DI ;
SATHAYE, SS ;
STROSNIDER, JK .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (09) :1140-1144
[6]  
Leung J. Y., 1982, PERFORMANCE EVALUATI, V2
[7]  
LIU CL, 1973, JACM, V20, P40
[8]  
Locke CD, 1990, CMUSEI90TR8
[9]  
MESCHI A, 1996, P WORKSH PAR DISTR R
[10]  
*MOT INC, 1996, MC68336376 US MAN