Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities

  • Karsten Albers
  • Frank Bodmann
  • Frank Slomka
Part of the IFIP – The International Federation for Information Processing book series (IFIPAICT, volume 231)


Task System Early Deadline First Feasibility Test Sporadic Task Schedulability Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. K. Albers, F. Slomka. An Event Stream Driven Approximation for the Analysis of Real-Time Systems. Proceedings of the 16th Euromicro Conference on Real-Time Systems, Catania, 2004Google Scholar
  2. K. Albers, F. Slomka. Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling, Proceedings of the Design Automation and Test in Europe Conference 2005 (DATE‘05), Munich, 2005Google Scholar
  3. N.C. Audsley, A. Burns, M.F. Richardson, A.J. Wellings. Hard real-time scheduling: The deadline monotonic approach. Proceedings of the 8th Workshop on Real-Time Operating Systems and Software, 1993Google Scholar
  4. S. Baruah Dynamic- and Static-priority Scheduling of Recurring Real-Time Tasks. Real-Time Systems. 24, 2003.Google Scholar
  5. E. Bini, G. Buttazzo, G. Buttazzo. The Hyperbolic Bound for Rate Monotonic Schedulability. Proceedings of the Euromicro Conference on Real-Time Systems, 2001.Google Scholar
  6. N. Fisher, S. Baruah. A polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines, Proceedings of the 17th Euromicro Conference on Real-Time Systems, Palma de Mallorca, 2005Google Scholar
  7. N. Fisher, S. Baruah. A Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Bounded Relative Deadlines, Proceedings of the 13th International Conference on Real-Time Systems, Paris, 2005Google Scholar
  8. C. Liu, J. Layland. Scheduling Algorithms for Multiprogramming in Hard Real-Time Environments, Journal of the ACM, 20(1), 1973Google Scholar
  9. J.P. Lehoczky, L. Sha, J.K. Stronsnider, H. Tokuda. Fixed Priority Scheduling Theory for Hard Real-Time Systems. Foundation of Real-Time Computing: Scheduling and Resource Management, 1991Google Scholar
  10. Y. Manabe, S. Aoyagi. A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling, Real-Time Systems, 14, 1998Google Scholar
  11. M. Sjödin, H. Hansson. Improved Response-Time Analysis Calculations, Proceedings of the RTSS, Madrid, Spain, 1998Google Scholar

Copyright information

© International Federation for Information Processin 2007

Authors and Affiliations

  • Karsten Albers
  • Frank Bodmann
  • Frank Slomka

There are no affiliations available

Personalised recommendations