Document Open Access Logo

The Multi-Domain Frame Packing Problem for CAN-FD

Authors Prachi Joshi, Haibo Zeng, Unmesh D. Bordoloi, Soheil Samii, S. S. Ravi, Sandeep K. Shukla

Thumbnail PDF


  • Filesize: 4.68 MB
  • 22 pages

Document Identifiers

Author Details

Prachi Joshi
Haibo Zeng
Unmesh D. Bordoloi
Soheil Samii
S. S. Ravi
Sandeep K. Shukla

Cite AsGet BibTex

Prachi Joshi, Haibo Zeng, Unmesh D. Bordoloi, Soheil Samii, S. S. Ravi, and Sandeep K. Shukla. The Multi-Domain Frame Packing Problem for CAN-FD. In 29th Euromicro Conference on Real-Time Systems (ECRTS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 76, pp. 12:1-12:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


The Controller Area Network with Flexible Data-Rate (CAN-FD) is a new communication protocol to meet the bandwidth requirements for the constantly growing volume of data exchanged in modern vehicles. The problem of frame packing for CAN-FD, as studied in the literature, assumes a single sub-system where one CAN-FD bus serves as the communication medium among several Electronic Control Units (ECUs). Modern automotive electronic systems, on the other hand, consist of several sub-systems, each facilitating a certain functional domain such as powertrain, chassis and suspension. A substantial fraction of all signals is exchanged across sub-systems. In this work, we study the frame packing problem for CAN-FD with multiple sub-systems, and propose a two-stage optimization framework. In the first stage, we pack the signals into frames with the objective of minimizing the bandwidth utilization. In the second stage, we extend Audsley's algorithm to assign priorities/identifiers to the frames. In case the resulting solution is not schedulable, our framework provides a potential repacking method. We propose two solution approaches: (a) an Integer Linear Programming (ILP) formulation that provides an optimal solution but is computationally expensive for industrial-size problems; and (b) a greedy heuristic that scales well and provides solutions that are comparable to optimal solutions. Experimental results show the efficiency of our optimization framework in achieving feasible solutions with low bandwidth utilization. The results also show a significant improvement over the case when there is no cross-domain consideration (as in prior work).
  • Frame Packing
  • CAN-FD
  • Integer Linear Programming
  • Audsley's Algorithm


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. N. C. Audsley. On priority assignment in fixed priority scheduling. Information Processing Letters, 79(1):39-44, 2001. URL:
  2. Unmesh Dutta Bordoloi and Soheil Samii. The frame packing problem for CAN-FD. In Proceedings of the IEEE 35th IEEE Real-Time Systems Symposium (RTSS), pages 284-293, December 2014. URL:
  3. Armaghan Darbandi, Sungoh Kwon, and Myung Kyun Kim. Scheduling of time triggered messages in static segment of FlexRay. International Journal of Software Engineering and its Applications, 8(6):195-208, 2014. URL:
  4. Robert I. Davis and Alan Burns. Robust priority assignment for messages on controller area network (can). Real-Time Systems, 41(2):152-180, 2009. URL:
  5. Robert I. Davis, Alan Burns, Reinder J. Bril, and Johan J. Lukkien. Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Systems, 35(3):239-272, 2007. URL:
  6. Robert I Davis, Liliana Cucu-Grosjean, Marko Bertogna, and Alan Burns. A review of priority assignment in real-time systems. Journal of Systems Architecture, 65:64-82, 2016. URL:
  7. Donald K. Friesen and Michael A. Langston. Variable sized bin packing. SIAM Journal on Computing, 15(1):222-230, 1986. URL:
  8. Michael R Garey and David S Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco, CA, 1979. Google Scholar
  9. Florian Hartwich. CAN with flexible data-rate. In Proc. 13th International CAN Conference (iCC), pages 14:1-14:9. CAN in Automation (CiA), 2012. Google Scholar
  10. Hogenmüller and Triess. Cost efficient gateway architecture for deterministic automotive networks, 2013. URL:
  11. Minkoo Kang, Kiejin Park, and Myong-Kee Jeong. Frame packing for minimizing the bandwidth consumption of the FlexRay static segment. IEEE Transactions on Industrial Electronics, 60(9):4001-4008, 2013. URL:
  12. S. Kramer, D. Ziegenbein, and A. Hamann. Real world automotive benchmark for free. In Workshop on Analysis Tools and Methodologies for Embedded and Real-Time Systems (WATERS), 2015. Google Scholar
  13. Martin Lukasiewycz, Michael Glaß, Jürgen Teich, and Paul Milbredt. FlexRay schedule optimization of the static segment. In Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis (CODES), pages 363-372. IEEE-ACM, 2009. URL:
  14. Inês Lynce and Joao P Marques-Silva. On computing minimum unsatisfiable cores. In Proceedings of the International Symposium on Theory and Applications of Satisfiability Testing, pages 305-310, 2004. Google Scholar
  15. Frank D Murgolo. An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 16(1):149-161, 1987. URL:
  16. Marco Di Natale, Celso Luiz Mendes da Silva, and Max Mauro Dias Santos. On the applicability of an MILP solution for signal packing in CAN-FD. In Proceedings of the IEEE 14th International Conference on Industrial Informatics (IEEE-INDIN), July, 2016. URL:
  17. Florian Polzlbauer, Iain Bate, and Eugen Brenner. Optimized frame packing for embedded systems. IEEE Embedded Systems Letters, 4(3):65-68, 2012. URL:
  18. Paul Pop, Petru Eles, and Zebo Peng. Schedulability-driven frame packing for multicluster distributed embedded systems. ACM Transactions on Embedded Computing Systems (TECS), 4(1):112-140, 2005. URL:
  19. Rishi Saket and Nicolas Navet. Frame packing algorithms for automotive applications. Journal of Embedded Computing, 2(1):93-102, 2006. URL:
  20. Kristian Sandstrom, C Norstom, and Magnus Ahlmark. Frame packing in real-time communication. In Proceedings of the Seventh International Conference on Real-Time Computing Systems and Applications, pages 399-403. IEEE, 2000. URL:
  21. Bogdan Tanasa, Unmesh Dutta Bordoloi, Petru Eles, and Zebo Peng. Reliability-aware frame packing for the static segment of FlexRay. In Proceedings of the Ninth ACM international conference on Embedded software, pages 175-184. ACM, 2011. URL:
  22. KW Tindell, Hans Hansson, and Andy J Wellings. Analysing real-time communications: controller area network (CAN). In Proceedings of Real-Time Systems Symposium, pages 259-263. IEEE, 1994. URL:
  23. Gökhan Urul. A Frame Packing Method to Improve the Schedulability of CAN and CAN-FD. PhD thesis, Middle East Technical University, Turkey, 2015. Google Scholar
  24. Haibo Zeng, Marco Di Natale, Arkadeb Ghosal, and Alberto Sangiovanni-Vincentelli. Schedule optimization of time-triggered systems communicating over the FlexRay static segment. IEEE Transactions on Industrial Informatics, 7(1):1-17, 2011. URL:
  25. Wei Zheng, Qi Zhu, Marco Di Natale, and Alberto Sangiovanni Vincentelli. Definition of task allocation and priority assignment in hard real-time distributed systems. In Real-Time Systems Symposium, 2007. RTSS 2007. 28th IEEE International, pages 161-170. IEEE, 2007. URL:
  26. Qi Zhu, Yang Yang, Eelco Scholte, Marco Di Natale, and Alberto Sangiovanni-Vincentelli. Optimizing extensibility in hard real-time distributed systems. In Real-Time and Embedded Technology and Applications Symposium, 2009. RTAS 2009. 15th IEEE, pages 275-284. IEEE, 2009. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail