论文信息 - Improved worst-case response-time calculations by upper-bound conditions

Improved worst-case response-time calculations by upper-bound conditions

Fast real-time feasibility tests and analysis algorithms are necessary for a high acceptance of the formal techniques by industrial software engineers. This paper presents a possibility to reduce the computation time required to calculate the worst-case response time of a task in a fixed-priority task set with jitter by a considerable amount of time. The correctness of the approach is proven analytically and experimental comparisons with the currently fastest known tests show the improvement of the new method.

[1] Mikael Sjödin,et al. Improved response-time analysis calculations , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[2] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[3] Enrico Bini,et al. Efficient computation of response time bounds under fixed-priority scheduling , 2007 .

[4] Giorgio C. Buttazzo,et al. Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.

[5] John A. Clark,et al. Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[6] W. Tindell. AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS , 1994 .

[7] Alan Burns,et al. An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

[8] Reinder J. Bril,et al. Initial values for online response time calculations , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[9] John P. Lehoczky,et al. Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.