Skip to main content
SpringerLink
Log in

Efficient transient overload tests for real-time systems

  • Conference paper
  • First Online:
Computer Performance Evaluation Modelling Techniques and Tools (TOOLS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1245))

Abstract

Timing requirements of real-time systems are usually specified in terms of deadlines which are often classified as being either hard, firm or soft. A hard task must always meet its deadline while a soft or firm one can occasionally miss them. When a task may miss a deadline, traditional scheduling tests do not provide information on the number of deadlines the task may miss. It may just miss a single deadline or may not meet a deadline at all. In this paper we introduce the any n in m and row n in m temporal constraints to model the transient overload a task may suffer. They express that in m consecutive invocations there are at least n deadlines met in any order or in a row. With these temporal constraints we can capture both hard, firm and soft requirements. We present a worst case response time based formulation to compute whether a given set of real-time tasks scheduled under fixed priority meets its n in m temporal constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. C. Audsley. Flexible scheduling in hard real-time systems. PhD theses. Department of Computer Science, University of York, 1993.

    Google Scholar 

  2. N. C. Audsley, A. Burns, R. I. Davis, K. W. Tindell, and A. J. Wellings. Fixed priority pre-emptive scheduling: An historical perspective. Real-Time Systems, 8, 1995.

    Google Scholar 

  3. N. C. Audsley, A. Burns, M.F. Richardson, and Wellings A.J. Stress: A simulator for hard real-time systems. Software-Practice and Experience, 24(6), June 1994.

    Google Scholar 

  4. N. C. Audsley, A. Burns, M.F. Richardson, and A.J. Wellings. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of the 8th IEEE Workshop on Real-Time Operating Systems and Software. Atlanta., May 1991.

    Google Scholar 

  5. N.C. Audsley, R.I. Davis, and A. Burns. Mechanisms for enhacing the flexibility and utility of hard real-time systems. In 15th Real Time System Symposium, December 1994., December 1994.

    Google Scholar 

  6. A. Burns. Scheduling hard real-time systems: A review. Software Engineering Journal, 6(3), 1991.

    Google Scholar 

  7. M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers, 44(12), December 1995.

    Google Scholar 

  8. M. Joseph and P. Pandya. Finding respone times in a real time system. BCS Computer Journal, 29(5), October 1986.

    Google Scholar 

  9. C. Juiz and R. Puigjaner. Approximate performance models of real time software systems. In Proceedings of MASCOTS 95, IEEE Computer Society Press, January 1995.

    Google Scholar 

  10. J.P. Lehoczky, L. Sha, and V. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. Technical report, Tech. Report. Department of Statistics, Carnegie-Mellon, 1987.

    Google Scholar 

  11. J.Y.T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands), 2(4), December 1982.

    Google Scholar 

  12. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), January 1973.

    Google Scholar 

  13. C.D. Locke, D.R. Voge, and R.J. Mesler. Building a predictable avionics platform in ada: A case study. In Real-Time Systems, San Antonio, Texas, 1991.

    Google Scholar 

  14. L. Sha, R. Rajkumar, and J.P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronisation. IEEE Transactions on Computers, 39(9), September 1990.

    Google Scholar 

  15. K.W. Tindell. Fixed priority scheduling of hard real-time systems. PhD theses. Department of Computer Science, University of York, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Matemàtiques i Informàtica, Univ. de les Illes Balears, Spain

    Guillem Bernat

  2. Dept. Computer Science, Univ. of York, England

    Alan Burns

  3. Dept. Enginyeria Informática, Univ. Rovira i Virgili, Tarragona, Spain

    Albert Llamosí

Authors
  1. Guillem Bernat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Burns
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Albert Llamosí
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Raymond Marie Brigitte Plateau Maria Calzarossa Gerardo Rubino

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernat, G., Burns, A., Llamosí, A. (1997). Efficient transient overload tests for real-time systems. In: Marie, R., Plateau, B., Calzarossa, M., Rubino, G. (eds) Computer Performance Evaluation Modelling Techniques and Tools. TOOLS 1997. Lecture Notes in Computer Science, vol 1245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022198

Download citation

  • DOI: https://doi.org/10.1007/BFb0022198

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63101-9

  • Online ISBN: 978-3-540-69131-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation