A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints
暂无分享,去创建一个
[1] Gérard Le Lann. A Methodology for Designing and Dimensioning Critical Complex Computing Systems , 1996, ECBS.
[2] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[3] John P. Lehoczky,et al. Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[4] Marco Spuri,et al. Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling , 1996 .
[5] Sanjoy K. Baruah,et al. Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[6] Charles U. Martel,et al. On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.
[7] Sanjoy K. Baruah,et al. Feasibility Problems for Recurring Tasks on one Processor , 1993, Theor. Comput. Sci..
[8] Aloysius Ka-Lau Mok,et al. Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .
[9] K. H. Kim,et al. Prevention of task overruns in real-time non-preemptive multiprogramming systems , 1980, PERFORMANCE '80.
[10] Michael L. Dertouzos,et al. Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.
[11] Rocquencourt,et al. Analysis of Deadline Scheduled Real-Time Systems , 1996 .
[12] John A. Clark,et al. Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.