期刊文献+

基于DMS和EDF的CAN总线混合调度算法 被引量:2

CAN Bus Hybrid Scheduling Algorithm Based on DMS and EDF
下载PDF
导出
摘要 针对CAN总线调度问题,分析了CAN网络中信息帧发生传输错误的概率化最大响应时间,融合DMS算法的可预测性良好、处理器开销低以及对数分区EDF算法的灵活性强、网络利用率高的特点,提出一种考虑消息关键性的混合调度算法;在上述研究基础上,利用MATLAB/SimEvents工具箱建立CAN网络模型,并对3种调度算法进行了仿真,当网络利用率达到约85%时,混合调度算法丢包率为0.8%,但丢失的数据不包含硬实时消息,而且成功降低了处理器的额外开销时间,仿真结果表明混合调度算法既能提高系统的实时性,又能减小处理器的运算负担。 In this paper we provide a probabilistic analysis of worst case response time of message with faults in the Controller Aera net- work (CAN). By studying and analyzing static scheduling algorithm Deadline Monotonous Scheduling (DMS) and dynamic scheduling algo- rithm Earliest Deadline First (EDF) in the CAN, and combining the good predictability and cheap processor cost of DMS algorithm with the strong flexibility and high utilization of logarithm partition EDF algorithm, this paper presented a hybrid scheduling algorithm with consider- ing critical level of messages. Based on the work mentioned above, the simulation platform of CANbus is developed with MATLAB/Si- mEvents tool box, The platform was used to real--time analysis for the scheduling algorithms mentioned before, the simulation results showed that the hybrid scheduling algorithm could not only improve the real--time performance of system, but also could reduce the cost of processor.
出处 《计算机测量与控制》 北大核心 2014年第5期1502-1505,共4页 Computer Measurement &Control
基金 国家自然科学基金(51174084) 武汉市科技青年晨光计划(201271031386)
关键词 WCRT DMS 对数分区EDF 混合调度 SimEvents工具箱 WCRT DMS logarithmic partition EDF hybrid scheduling SimEvents tool box
  • 相关文献

参考文献14

  • 1Hong S H. Scheduling algorithm of data sampling times in the inte- grated communication and control systems [J]. IEEE Transactions on control systems technology, 1995, 3 (2) : 225 - 230.
  • 2Leen G, Heffernan D. TTCAN: a new time - triggered controller area network [J]. Microprocessors and Microsystems, 2002, 26 (2) : 77 - 94.
  • 3Lui Sha, Rajkumar R. Generalized rate - monotonic schedulingtheory., a framework for developing real- time systems ['C']. Pro- ceedings of thelEEE, 1994, 82 (1): 68-82.
  • 4Ian Broster, Alan Burns, Guillermo Rodriguez - Navas. Probabi- listic Analysis of CAN with Fault [J]. IEEE, 2002.
  • 5Natale M D. Scheduling the CAN bus with earliest deadline tech- niques [C]. 21st IEEE Real-Time Systems, 2000.
  • 6Moke A K. Fundamental design problems of distributed systems for the hard - real - time environment [D]. Laboratory for Computer Science, MIT, Cambridge, Mass, 1983.
  • 7Stankovic J A, Spuri M, Ramam ritham K, et al. Deadline sched- uling for real- time system: EDF and related algorithms [M] . Boston: Kluwer Academic, 1998.
  • 8谌介人,彭军,吴敏,张晓勇.CAN总线中EDF调度算法的研究与改进[J].计算机测量与控制,2008,16(11):1678-1681. 被引量:11
  • 9Tindell K, Burns A, Wellings A. Calculating Controller Area Network (CAN) message response time [J]. Control Engineer-ingPractice, 1995, 3 (8): 1163-1169.
  • 10Tindell K. An Extendible approach for analysing fixed priority hard real - time systems [J]. Journal of Real - Time System, 1994, 6 (2): 133-152.

二级参考文献18

  • 1邬明宽.CAN总线原理和应用系统设计[M].北京:北京航空航天大学出版社,2001.
  • 2Kopetz H. The Time-Triggered Model of Computation[A]. in Proceedings of the 19th IEEE Real- Time Systems Symposium(RTSS98)[C]. Madrid, Spain: IEEE Computer Society, December 1998, 168-177.
  • 3Nolte T and Lin K J. Distributed Real-Time System Design using CBS--based End--to--end Scheduling EA3. in Proceedings of the 9th IEEE International Conference on Parallel and Distributed Systems (ICPADS'02) [C]. Taipei, Taiwan, ROC:IEEE Computer Society, December 2002, 355-360.
  • 4Zuberi K M and Shin K G , Non--Preemptive Scheduling of Messages on Controller Area Network for Real-- Time Control Applica tions [A]. in Proceedings of the 1st IEEE Real-Time Technology and Applications Symposium (RTAS'95)[C]. Chicago, IL, USA: IEEE Computer Society, May 1995, 240-249.
  • 5Livani M and Kaiser J. EDF Consensus on CAN Bus Access for Dy namic Real-Time Applications[A]. in Proceedings of the 6th In ternational Workshop on Parallel and Distributed Real-Time Sys terns (WPDRTS'98) [C]. Orlando, Florida, USA, March 1998.
  • 6Liu C L, Layland J W. Scheduling Algorithms for Muhiprogram ruing in a Hard Real-Time Environment [J].Journal of the ACM, 1973, 20 (1): 40-61.
  • 7Davis R I Burns A,Bril R J,et al.Controller area net-work(CAN)schedulability analysis:Refuted,revisitedand revised[J].Real-Time Systems,2007,35(3):239-272.
  • 8Tindell K,Burns A.Guaranteeing message latencies oncontroller area network[C] //Proceedings of 1st Interna-tional CAN Conference.Wiesbaden,Germany,1994:2-11.
  • 9Tindell K,Burns A,Wellings A J.An extendible ap-proach for analysing fixed priority hard realtime sys-tems[J].Journal of Real-Time Systems,1994,6(2):133-152.
  • 10Burns A.Preemptive priority based scheduling:An ap-propriate engineering approach[J].Advances in Real-Time Systems,1994:222-245.

共引文献23

同被引文献20

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部