检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:管长焦[1]
机构地区:[1]煤炭科学研究总院沈阳研究院,辽宁抚顺113122
出 处:《电气技术》2014年第3期67-69,共3页Electrical Engineering
摘 要:针对在CAN总线中应用动态调度最小时间裕度优先(LSF)调度时存在的问题,基于CAN总线的仲裁机制,提出了基于事件触发的LSF算法,介绍了LSF原理及可调度性分析方法,将该调度算法应用于汽车车身控制系统,验证了其调度算法的可行性,通过对比DM(Deadline Monotonic)调度,验证了该LSF算法的良好调度性能。Dynamic schedule strategies can bring higher resource utilization of network then static ones, while techniques such as least slack time first(LSF) scheduling can hardly be applied to CAN bus. To solve these problems, an event-triggered LSF algorithm based on CAN bus arbitration is proposed. The principle and schedulability analysis of LSF and the overhead of processor are given. Finally the LSF is used to schedule vehicle body system by compare with DM algorithm, the scheduling result verifies that the proposed LSF is feasible, and has perfect performance.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28