The Frame Packing Problem for CAN-FD
2014 (English)In: Real-Time Systems Symposium (RTSS 2014), Rome, Italy, Dec. 2-5, 2014., IEEE Press, 2014, 284-293 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE Press, 2014. 284-293 p.
, Real-Time Systems Symposium, ISSN 1052-8725
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-114468DOI: 10.1109/RTSS.2014.8OAI: oai:DiVA.org:liu-114468DiVA: diva2:789930