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

Shan DING; Gang ZENG; Ryo KURACHI; Ruifeng HUANG

doi:10.1587/transinf.2017EDP7073

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

Shan DING, Gang ZENG, Ryo KURACHI, Ruifeng HUANG

Full Text Views

0

Share
Cite this

Summary :

As 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.

Publication: IEICE TRANSACTIONS on Information Vol.E100-D No.10 pp.2505-2514

Publication Date: 2017/10/01

Publicized: 2017/07/18

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2017EDP7073

Type of Manuscript: PAPER

Category: Software System

Authors

Shan DING
  Northeastern University
Gang ZENG
  Nagoya University
Ryo KURACHI
  Nagoya University
Ruifeng HUANG
  Northeastern University

Keyword

in-vehicle network, Controller Area Network, frame packing, network bandwidth, schedulability

Cite this

Copy

Shan DING, Gang ZENG, Ryo KURACHI, Ruifeng HUANG, "A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints" in IEICE TRANSACTIONS on Information, vol. E100-D, no. 10, pp. 2505-2514, October 2017, doi: 10.1587/transinf.2017EDP7073.
Abstract: As 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.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.2017EDP7073/_p

Copy

@ARTICLE{e100-d_10_2505,
author={Shan DING, Gang ZENG, Ryo KURACHI, Ruifeng HUANG, },
journal={IEICE TRANSACTIONS on Information},
title={A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints},
year={2017},
volume={E100-D},
number={10},
pages={2505-2514},
abstract={As 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.},
keywords={},
doi={10.1587/transinf.2017EDP7073},
ISSN={1745-1361},
month={October},}

Copy

TY - JOUR
TI - A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints
T2 - IEICE TRANSACTIONS on Information
SP - 2505
EP - 2514
AU - Shan DING
AU - Gang ZENG
AU - Ryo KURACHI
AU - Ruifeng HUANG
PY - 2017
DO - 10.1587/transinf.2017EDP7073
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2017
AB - As 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.
ER -