论文信息 - GUARANTEED MESSAGE LATENCIES FOR DISTRIBUTED SAFETY-CRITICAL HARD REAL-TIME CONTROL NETWORKS1

GUARANTEED MESSAGE LATENCIES FOR DISTRIBUTED SAFETY-CRITICAL HARD REAL-TIME CONTROL NETWORKS1

Analysis is presented that enables the worst case latencies for Controller Area Network (CAN) messages to be predicted. The analysis is illustrated in terms of the Intel 82527 controller and applied to a SAE benchmark. This benchmark contains some 53 message types; all of which are analysed for various transmission rates. Techniques are presented that enables the temporal behaviour of a CAN system to be improved. In particular the impact of message “piggybacking” is assessed. The paper concludes by considering error recovery, and presents a framework into which different failure models can be incorporated and analysed (in terms of the impact failures have on message latencies).

Alan Burns | Ken Tindell | K. Tindell | A. Burns

[1] Joseph Y.-T. Leung,et al. On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[2] Alan Burns,et al. Fixed priority scheduling with deadlines prior to completion , 1994, Proceedings Sixth Euromicro Workshop on Real-Time Systems.

[3] Alan Burns,et al. Guaranteeing message latencies on controller area network (can) , 1994 .

[4] John P. Lehoczky,et al. The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[5] Hermann Kopetz. A solution to an automotive control system benchmark , 1994, 1994 Proceedings Real-Time Systems Symposium.

[6] John A. Clark,et al. Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[7] Alan Burns,et al. Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..