Controller area network (CAN) schedulability analysis for messages with arbitrary deadlines in FIFO and work-conserving queues

The majority of research into schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. In practice; however, some CAN device drivers and communications stacks implement queuing policies that are not strictly priority-based, invalidating this assumption. In this paper, we introduce response time analysis for work conserving and FIFO queuing policies for messages with arbitrary deadlines.

[1]  Reinder J. Bril,et al.  Integrating hardware limitations in CAN schedulability analysis , 2010, 2010 IEEE International Workshop on Factory Communication Systems Proceedings.

[2]  Alan Burns,et al.  Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[3]  Robert I. Davis,et al.  Schedulability analysis of CAN with non-abortable transmission requests , 2011, ETFA2011.

[4]  Alan Burns,et al.  Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised , 2007, Real-Time Systems.

[5]  Nicolas Navet,et al.  NETCARBENCH: A BENCHMARK FOR TECHNIQUES AND TOOLS USED IN THE DESIGN OF AUTOMOTIVE COMMUNICATION SYSTEMS , 2007 .

[6]  Robert I. Davis,et al.  Controller Area Network (CAN) Schedulability Analysis with FIFO Queues , 2011, 2011 23rd Euromicro Conference on Real-Time Systems.

[7]  Neil Audsley,et al.  OPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES , 2007 .

[8]  Marco Di Natale.  Evaluating message transmission times in Controller Area Networks without buffer preemption , 2006 .

[9]  Alan Burns,et al.  Calculating controller area network (can) message response times , 1994 .

[10]  Neil C. Audsley,et al.  On priority assignment in fixed priority scheduling , 2001, Inf. Process. Lett..

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

[12]  Laurent George,et al.  Non-premptive Fixed Priority schedulingwith FIFO arbitration:uniprocessor and distributed cases , 2004 .

[13]  Alan Burns,et al.  Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems , 2010, Real-Time Systems.