Scheduling hard and soft real-time communication in a controller area network

Abstract The paper introduces a mechanism to implement distributed scheduling for the CAN-bus resource in order to meet the requirements of a dynamic distributed real-time system. The key issues considered here are multicasting, distinguishing between hard real-time, soft real-time, and non-real-time constraints, achieving high resource utilization for the CAN-bus, and supporting dynamic hard real-time computing by allowing dynamic reservation of communication resources.

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

[2]  Jörg Kaiser,et al.  Invocation of real-time objects in a CAN bus-system , 1998, Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98).

[3]  Krithi Ramamritham,et al.  The Spring kernel: a new paradigm for real-time operating systems , 1989, OPSR.

[4]  Martin Gergeleit,et al.  Implementing a distributed high-resolution real-time clock using the CAN-bus , 1994 .

[5]  Kang G. Shin,et al.  Non-preemptive scheduling of messages on controller area network for real-time control applications , 1995, Proceedings Real-Time Technology and Applications Symposium.

[6]  Alan Burns,et al.  Deadline Monotonic Scheduling Theory , 1992 .

[7]  Hermann Kopetz,et al.  THE ARCHITECTURE OF MARS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[8]  Jörg Kaiser,et al.  A Total Ordering Scheme for Real-Time Multicasts in CAN , 1999 .

[9]  Hermann Kopetz,et al.  TTP - A time-triggered protocol for fault-tolerant real-time systems , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.