A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines

Authors:
Enrico Bini;Thi Huyen Châu Nguyen;Pascal Richard;Sanjoy K. Baruah
Affiliations:
Scuola Superiore Sant'Anna, Pisa;University of Poitiers, Poitiers;University of Poitiers, Poitiers;University of North Carolina, Chapel Hill
Venue:
IEEE Transactions on Computers
Year:
2009

Citing 0
Cited 7

Approximation techniques for response-time analysis of static-priority tasks

Real-Time Systems
Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling

Real-Time Systems
Optimization of task allocation and priority assignment in hard real-time distributed systems

ACM Transactions on Embedded Computing Systems (TECS)
Enhancing OSGi with real-time Java support

Software—Practice & Experience
Design of safety-critical Java level 1 applications using affine abstract clocks

Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Stability-aware analysis and design of embedded control systems

Proceedings of the Eleventh ACM International Conference on Embedded Software
A real-time perspective of service composition: Key concepts and some contributions

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	14.98

Visualization

Abstract

Since worst case response times must be determined repeatedly during the interactive design of real-time application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we identify three desirable properties of estimates of the exact response times: continuity with respect to system parameters, efficient computability, and approximability. We derive a technique possessing these properties for estimating the worst-case response time of sporadic task systems that are scheduled using fixed priorities upon a preemptive uniprocessor.