The Frame Packing Problem for CAN-FD

Bordoloi, Unmesh D.; Samii, Soheil

doi:10.1109/rtss.2014.8

Cited by 34 publications

(19 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…W i k is the CAN FD frame size of the kth type of frame corresponding to a packed frame f i . CAN FD allows payloads of 1,2,3,4,5,6,7,8,12,16,20,24,32,48 or 64 bytes. Therefore, W i k refers to one value of the above bytes, and k ∈ [1,15].…”

Section: Formulation Of Frame Packing Problemmentioning

confidence: 99%

“…The arbitration bit rate and data bit rate of CAN FD are set to 500Kbit/s, and 2Mbit/s, respectively, which are the same with the parameters used in [2]. For the parameters of GA, the number of individuals in each generation N ind and the number of generations N gen are set to 200 and 800, respectively, and the probability of mutation p m is set to 0.005.…”

Section: Experimental Objective and Setupmentioning

confidence: 99%

“…As mentioned earlier, since the CAN FD frame Selection method CaFeS [2] is the state-of-the-art in the literature, we select it for comparison. The CaFeS method is an optimization heuristic that intends to decrease bandwidth waste of the signal communication.…”

Section: Evaluation Of Reduction On Bandwidth Utilizationmentioning

confidence: 99%

“…The other is that all packed frames should meet their deadlines when transmitting them on the CAN bus. Additionally, as stated in [2], the frame packing problem is a typical variable sized bin packing problem, which is NP hard.…”

Section: Introductionmentioning

confidence: 99%

“…Polzlbauer et al [6] also presented a heuristic based on the next-fit decreasing algorithm, and proposed an additional standard for assessing whether to add a signal to an existing frame according to its impact on bandwidth utilization. Recently, Bordoloi and Samii [2] proposed a two-stage framework for CAN FD Frame Selection (CaFeS) problem and schedulability verification of packed frames. In the first stage, a dynamic programing method was proposed for bandwidth optimized packing subject to the CAN FD size requirement.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints

Ding

Zeng

Kurachi

et al. 2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYAs a next-generation CAN (Controller Area Network), CAN FD (CAN with flexible data rate) has attracted much attention recently. However, how to use the improved bus bandwidth efficiently in CAN FD is still an issue. Contrasting with existing methods using greedy approximate algorithms, this paper proposes a genetic algorithm for CAN FD frame packing. It tries to minimize the bandwidth utilization by considering the different periods of signals when packing them in the same frame. Moreover, it also checks the schedulability of packed frames to guarantee the real-time constraints of each frame and proposed a merging algorithm to improve the schedulability for signal set with high bus load. Experimental results validate that the proposed algorithm can achieve significantly less bandwidth utilization and improved schedulability than existing methods for a given set of signals.

show abstract