%0 Journal Article
%T Optimal Algorithms for Scheduling Based-on the Time Triggered CAN Protocol<br>基于时间触发的CAN协议任务调度优化算法
%A ZHU Zhi-Lin
%A LIU Xiao-Hua
%A HAN Jun-Gang
%A <br>朱智林
%A 刘晓华
%A 韩俊刚
%J 计算机科学
%D 2005
%I 
%X 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.
%K TTCAN
%K Scheduling
%K Optimal algorithm
%K Asymptotic performance ratio<br>TTCAN
%K 调度
%K 优化算法
%K 渐近性能比
%K CAN协议
%K 优化算法
%K 时间触发
%K 任务调度
%K 渐近性能比
%K 基本周期
%K 时间复杂度
%K 分布系统
%K 调度表
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=BA14CEB3A5E62F7D&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=F3090AE9B60B7ED1&sid=797D49279EA93BC4&eid=1B64850025D0BBBE&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=6