Research on Hybrid Scheduling Algorithm Based on CAN bus
DOI:
Author:
Affiliation:

1.School of Electrical and Electronic Engineering, Tianjin University of Technology, Tianjin Key Laboratory of Complex System Control Theory and Application, Tianjin 300384; 2.Transmission and Launch Department, Tianjin Radio and TV Station, Tianjin 300072

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In view of the problem that the packet information preempted network resources in the process of transmission in the CAN bus, which leads to the low utilization of network resources and the low accuracy of information transmission. Thus, a hybrid scheduling algorithm NMTS based on CAN bus is proposed, in the NMTS hybrid scheduling algorithm, the dynamic scheduling algorithm EDF is used to schedule hard real-time messages to solve the problem of low utilization of network resources; the static scheduling algorithm RMS is used to schedule soft real-time messages and non real-time messages, so as to solve the problem of low accuracy of information transmission. By using MATLAB software, the CAN network model can be built, the EDF algorithm, RMS algorithm and NMTS algorithm are simulated. The experimental results show that the network resources utilization is 90%, the packet loss rate is 0% of the NMTS algorithm. Therefore, The hybrid scheduling algorithm based on CAN bus NMTS has the characteristics of high network resource utilization and high accuracy of information transmission, which will be very helpful for further research of CAN bus.

    Reference
    Related
    Cited by
Get Citation

HAN Shunyuan, ZHANG Zhihong, HE Hong.[J]. Instrumentation,2017,4(2):22-27

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: January 07,2019
  • Published:
License
  • Copyright (c) 2023 by the authors. This work is licensed under a Creative
  • Creative Commons Attribution-ShareAlike 4.0 International License.