Optimal Algorithms for Scheduling Based-on the Time Triggered CAN Protocol
基于时间触发的CAN协议任务调度优化算法

Time-Triggered CAN protocol task scheduling is an important problem in real-time distributed systems, which are based on Time-trggered CAN protocol. An optimal algorithm, which has polynomial time complexity, is proposed to construct scheduling tables. For the algorithm, four strategies to determine basic cycle(BC)are presented. Experiment results of the algorithm are given in different problem size and data precision. Asymptotic performance rati- o of the algorithm in different BC strategies is shown in detail.