AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS
暂无分享,去创建一个
[1] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[2] Joseph Y.-T. Leung,et al. On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.
[3] Mathai Joseph,et al. Finding Response Times in a Real-Time System , 1986, Comput. J..
[4] Lui Sha,et al. Real-time synchronization protocols for multiprocessors , 1988, Proceedings. Real-Time Systems Symposium.
[5] John P. Lehoczky,et al. The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.
[6] Lui Sha,et al. Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.
[7] John P. Lehoczky,et al. Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[8] C. Douglas Locke,et al. Building a predictable avionics platform in Ada: a case study , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.
[9] Alan Burns,et al. Mode changes in priority preemptively scheduled systems , 1992, [1992] Proceedings Real-Time Systems Symposium.
[10] Alan Burns,et al. Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..