Hierarchical Scheduling of CAN using Server-Based Techniques

Server-based scheduling of CAN has been proposed as a way of fair scheduling of the Controller Area Network (CAN). By separating streams of messages by using network access servers (N-Servers), scheduling is performed at three layers where native CAN message arbitration is the scheduling at the lowest level. On top of this is the server-based scheduling to separate different streams of messages within the system. Looking at a single N-Server, several streams might share one server. Hence, scheduling is performed at the third level every time the N-Server is being scheduled for message transmission. Here different queuing policies play a role in the scheduling performed. This paper discusses the hierarchical scheduling of CAN, as a way of fair separation of message streams while providing a flexible core mechanism, the serverbased scheduling of CAN.

[1]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, RTSS 1987.

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[3]  Luís Almeida.  Response-time analysis and server design for hierarchical scheduling , 2003 .

[4]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[5]  Mikael Sjödin,et al.  Server-based scheduling of the CAN bus , 2003, EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696).

[6]  Kwei-Jay Lin,et al.  An optimal pinwheel scheduler using the single-number reduction technique , 1996, 17th IEEE Real-Time Systems Symposium.

[7]  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.

[8]  José Alberto Fonseca,et al.  The FTT-CAN protocol: why and how , 2002, IEEE Trans. Ind. Electron..

[9]  Marco Spuri,et al.  Robust aperiodic scheduling under dynamic priority systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

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

[11]  Jörg Kaiser,et al.  EDF Consensus on CAN Bus Access for Dynamic Real-Time Applications , 1998, IPPS/SPDP Workshops.

[12]  Hermann Kopetz,et al.  The time-triggered model of computation , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[13]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[14]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.