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

Authors:
Victor Pollex;Steffen Kollmann;Karsten Albers;Frank Slomka
Affiliations:
Ulm University;Ulm University;Ulm University;Ulm University
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2009

Citing 6
Cited 0

An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Holistic schedulability analysis for distributed hard real-time systems

Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Improved Response-Time Analysis Calculations

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
On Schedulability Bounds of Static Priority Schedulers

RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Measuring the Performance of Schedulability Tests

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.