Advertisement

Analyzing Stochastic Fixed-Priority Real-Time Systems

  • Mark K. Gardner
  • Jane W. S. Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1579)

Abstract

Traditionally, real-time systems require that the deadlines of all jobs be met. For many applications, however, this is an overly stringent requirement. An occasional missed deadline may cause decreased performance but is nevertheless acceptable. We present an analysis technique by which a lower bound on the percentage of deadlines that a periodic task meets is determined and compare the lower bound with simulation results for an example system. We have implemented the technique in the PERTS real-time system prototyping environment [6], [7].

Keywords

Execution Time Critical Instant Time Demand Periodic Task Response Time Distribution 
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.

References

  1. [1]
    A. K. Atlas and A. Bestavros. Statistical rate monotonic scheduling. Technical Report BUCS-TR-98-010, Boston University, 1998.Google Scholar
  2. [2]
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.Google Scholar
  3. [3]
    J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings of the 11th Real-Time System Symposium, December 1990.Google Scholar
  4. [4]
    J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the 10th Real-Time System Symposium, pages 166–171, December 1989.Google Scholar
  5. [5]
    C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery, 20(1):46–61, January 1973.zbMATHMathSciNetGoogle Scholar
  6. [6]
    J. W. S. Liu, C. L. Liu, Z. Deng, T. S. Tia, J. Sun, M. Storch, D. Hull, J. L. Redondo, R. Bettati, and A. Silberman. PERTS: A prototyping environment for real-time systems. International Journal of Software Engineering and Knowledge Engineering, 6(2):161–177, 1996.CrossRefGoogle Scholar
  7. [7]
    J. W. S. Liu, J. L. Redondo, Z. Deng, T. S. Tia, R. Bettati, A. Silberman, M. Storch, R. Ha, and W. K. Shih. PERTS: A prototyping environment for real-time systems. In Proceedings of the 14th IEEE Real-Time Systems Symposium, pages 184–188, Raleigh-Durham, North Carolina, December 1993.Google Scholar
  8. [8]
    H. J. Nussbaumer. Fast Fourier Transform and Convolution Algorithms. Springer-Verlag, second edition, 1982.Google Scholar
  9. [9]
    W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, second edition, 1992.Google Scholar
  10. [10]
    T.-S. Tia, Z. Deng, M. Shankar, M. Storch, J. Sun, L.-C. Wu, and J. W.-S. Liu. Probabilistic performance guarantee for real-time tasks with varying computation times. In Proceedings of the Real-Time Technology and Applications Symposium, pages 164–173, Chicago, Illinois, May 1995. IEEE.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Mark K. Gardner
    • 1
  • Jane W. S. Liu
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations