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

@article{Fisher2005AFP,
  title={A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines},
  author={Nathan Fisher and Sanjoy K. Baruah},
  journal={17th Euromicro Conference on Real-Time Systems (ECRTS'05)},
  year={2005},
  pages={117-126}
}
Current feasibility tests for the static-priority scheduling on uniprocessors 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 with arbitrary relative deadlines. This test is an approximation with respect to the amount of a processor's capacity that must be "sacrificed" for the test to become exact. We show that an arbitrary level of accuracy, /spl epsi/, may be chosen for… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Modified ratemonotonic algorithm for scheduling periodic jobs with deferred deadlines

  • S W.K., L J.W.S., L C.L.
  • IEEE Transactions on Software Engineering 19,
  • 1993
1 Excerpt

On the complexity of fixedpriority scheduling of periodic, real-time tasks

  • L J., J. W
  • Performance Evaluation
  • 1982
2 Excerpts

Similar Papers

Loading similar papers…