Linköping University: Students Alumni Trade and Industry/Society Internal Search

The Frame Packing Problem for CAN-FD

Unmesh D. Bordoloi
Soheil Samii

Real-Time Systems Symposium (RTSS 2014), Rome, Italy, Dec. 2-5, 2014.

CAN with flexible data rate (CAN-FD) allows transmission of larger payloads compared to standard CAN. However, efficient utilization of CAN- FD bandwidth space calls for a systematic strategy. The challenge arises from the nature of the frame sizes stipulated by CAN-FD as well as the heterogeneity of the periods of the messages and the signals. In this paper, we formulate a frame packing problem for CAN-FD with the optimization objective of bandwidth utilization while meeting temporal constraints. As part of the solution, first, we propose a formula to compute the best-case and the worst-case transmission times of the CAN-FD frames. Thereafter, we propose a framework that solves the optimization problem in pseudo-polynomial time. Experiments show the gains achieved by our framework. The results also show that, when applied to standard CAN, our heuristic provides improved results over existing techniques.

Related files:
unmbo_RTSS14.pdfAdobe Acrobat portable document

[DS14] Unmesh D. Bordoloi, Soheil Samii, "The Frame Packing Problem for CAN-FD", Real-Time Systems Symposium (RTSS 2014), Rome, Italy, Dec. 2-5, 2014.
( ! ) perl script by Giovanni Squillero with modifications from Gert Jervan   (v3.1, p5.2, September-2002-)