CAN (Controller Area Network) operation observes event triggering standards, it is widely applied in real-time distributional control system of the automobile electronic control system, satellite control system, medical equipment's electronic control system as well as the textile equipment and so on. As the extension of offline bin-packing problem, periodic task scheduling has many important applications in real-time distributed systems. For time triggered CAN control systems, two strategies to determine the basic cycle (BC) of TTCAN are presented. Next-fit algorithm, next-fit descending algorithm, best-fit algorithm and best-fit descending algorithm are proposed to construct periodic task scheduling tables. Time complexity and worst-case asymptotic performance ratio of these algorithms are analyzed, and the experimental results indicate that NFA algorithm is not worse than NFDA algorithm, BFA is also not worse than BFDA algorithm, four algorithms have the advantage over the typical one-dimensional bin-packing algorithm.
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization