A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines

Authors:
Nathan Fisher;Sanjoy Baruah
Affiliations:
(Correspd. Tel.: +1 919 843 7412/ Fax: +1 919 962 1416/ E-mail: fishern@cs.unc.edu) Department of Computer Science, CB &num/3175, The University of North Carolina, Chapel Hill, NC 27599, USA;Department of Computer Science, CB &num/3175, The University of North Carolina, Chapel Hill, NC 27599, USA
Venue:
Journal of Embedded Computing - Best Papers of RTS' 2005
Year:
2006

Citing 3
Cited 1

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
An Event Stream Driven Approximation for the Analysis of Real-Time Systems

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems

Reliability comparison of schedulability test in ubiquitous computing

UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current feasibility tests for the static-priority scheduling of periodic task systems run in pseudo-polynomial time. We present a fully polynomial-time approximation scheme (FPTAS) for feasibility analysis in static-priority systems where each task's relative deadline is constrained to be at most its period. This test is an approximation with respect to the amount of processor capacity that must be "sacrificed" for the test to become exact. We show that an arbitrary level of accuracy, ε, may be chosen for the approximation scheme, and present a run-time bound that is polynomial in terms of ε and the number of tasks, n.