Offset Assignment to Signals for Improving Frame Packing in CAN-FD

Controller Area Network (CAN) is a widely used protocol that allows communication among Electronic Control Units (ECUs) in automotive electronics. It was extended to CAN-FD (CAN with Flexible Data-rate) to meet the increasing demand for bandwidth utilization caused by the growing number of features in modern automobiles. The signal-to-frame packing problem has been studied in literature for both CAN and CAN-FD. In this work, we propose and formulate, for the first time, the signal offset assignment problem (SOAP) in a frame in order to improve the bus bandwidth utilization. We prove that SOAP is NP-complete. We propose a general approximation framework (GAF) for SOAP which can use any approximation algorithm for the makespan minimization problem (MMP) in multiprocessor systems. We derive the performance guarantee provided by GAF as a function of the performance guarantee of the approximation algorithm for MMP and the number of signal periods in the frame. We demonstrate the efficacy of our approach through experiments using three different algorithms (two approximation algorithms and an integer linear programming formulation) for MMP in GAF. Our results indicate that by using offsets for signals in frame packing schemes, one can achieve about 10.54% improvement in bandwidth utilization (on a single bus) in CAN-FD systems.

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  Robert Bosch,et al.  CAN with Flexible Data-Rate , 2012 .

[3]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[4]  Petru Eles,et al.  Reliability-Aware Frame Packing for the static segment of FlexRay , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

[5]  Marco Di Natale,et al.  On the applicability of an MILP solution for signal packing in CAN-FD , 2016, 2016 IEEE 14th International Conference on Industrial Informatics (INDIN).

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

[7]  Mathieu Grenier,et al.  Pushing the limits of CAN - scheduling frames with offsets provides a major performance boost , 2008 .

[8]  Florian Pölzlbauer,et al.  Optimized Frame Packing for Embedded Systems , 2012, IEEE Embedded Systems Letters.

[9]  Nicolas Navet,et al.  Plasticity--Theory and Application , 1968 .

[10]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[11]  Gökhan Urul,et al.  A FRAME PACKING METHOD TO IMPROVE THE SCHEDULABILITY ON CAN AND CAN-FD , 2015 .

[12]  Alberto L. Sangiovanni-Vincentelli,et al.  Schedule Optimization of Time-Triggered Systems Communicating Over the FlexRay Static Segment , 2011, IEEE Transactions on Industrial Informatics.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Christer Norström,et al.  Frame packing in real-time communication , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[15]  Sandeep K. Shukla,et al.  The Multi-Domain Frame Packing Problem for CAN-FD , 2017, ECRTS.

[16]  Michael González Harbour,et al.  Schedulability analysis for tasks with static and dynamic offsets , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[17]  Martin Lukasiewycz,et al.  FlexRay schedule optimization of the static segment , 2009, CODES+ISSS '09.

[18]  Sungoh Kwon,et al.  Scheduling of Time Triggered Messages in Static Segment of FlexRay , 2014 .

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

[20]  Kiejin Park,et al.  Frame Packing for Minimizing the Bandwidth Consumption of the FlexRay Static Segment , 2013, IEEE Transactions on Industrial Electronics.

[21]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[22]  Petru Eles,et al.  Schedulability-driven frame packing for multicluster distributed embedded systems , 2005, TECS.

[23]  Andy J. Wellings,et al.  Analysing real-time communications: controller area network (CAN) , 1994, 1994 Proceedings Real-Time Systems Symposium.

[24]  Soheil Samii,et al.  The Frame Packing Problem for CAN-FD , 2014, 2014 IEEE Real-Time Systems Symposium.

[25]  Éva Tardos,et al.  Algorithm design , 2005 .