Skip to main content
Springer Nature Link
Log in

Calculating the maximum execution time of real-time programs

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

In real-time systems, the timing behavior is an important property of each task. It has to be guaranteed that the execution of a task does not take longer than the specified amount of time. Thus, a knowledge about the maximum execution time of programs is of utmost importance.

This paper discusses the problems for the calculation of the maximum execution time (MAXT... MAximum eXecution Time). It shows the preconditions which have to be met before the MAXT of a task can be calculated. Rules for the MAXT calculation are described. Triggered by the observation that in most cases the calculated MAXT far exceeds the actual execution time, new language constructs are introduced. These constructs allow programmers to put into their programs more information about the behavior of the algorithms implemented and help to improve the self checking property of programs. As a consequence, the quality of MAXT calculations is improved significantly. In a realistic example, an improvement fator of 11 has been achieved.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • DarlingtonJ., and R.M.Burstall. 1978. A system which automatically improves programs. In David GriesProgramming Methodology. Springer, New York.

    Google Scholar 

  • EhrenbergerW. 1983. Softwarezuverlässigkeit und Programmiersprache.Regelungstechnische Praxis, 25. Jhrg., Nr. 1: 24–29.

    Google Scholar 

  • Fohler G., and Ch. Koza. 1989. Heuristic scheduling for distributed real-time systems.Research Report No. 6/89 (Apr.) Institut für Technische Informatik, Technical University of Vienna.

  • HalangW.A. 1984. A proposal for extensions of PEARL to facilitate the formulation of hard real-time applications. Proceedings “Fachtagung Prozessrechner 1984”, Karlsruhe, Sep. 1984. Informatik-Fachberichte 86, Springer, Berlin-Heidelberg-New York-Tokyo, 1984, pp. 573–582.

    Google Scholar 

  • HalangW.A., 1989. A priori execution time analysis for parallel processes.Proceedings of the Euromicro Workshop on Real-Time. (Como, June), Washington, IEEE Computer Society Press.

    Google Scholar 

  • KernighanB.W., and D.M.Ritchie 1986. The C Programming Language. Prentice Hall, New Jersey.

    Google Scholar 

  • Kligerman E., and A.D. Stoyenko. Real-time Euclid: A language for reliable real-time systems.IEEE Transactions on Software Engineering, SE-12, 9 (Sept), 941–949.

  • Kopetz, H., A. Damm, Ch. Koza, M. Mulazzani, W. Schwabl, Ch. Senft, and R. Zainlinger. 1989. Distributed fault-tolerant real-time systems: The MARS approach.IEEE Micro (Feb.).

  • LeinbaughD.W. 1980. Guaranteed Response times in a hard-real-time environment.IEEE Transactions on Software Engineering, SE-6, 1 (Jan.), 85–91.

    Google Scholar 

  • Leinbaugh, D.W. and M.-R. Yamini. 1982. Guaranteed response times in a distributed hard-real-time environment.Proceedings of Real Time Systems Symposium (Dec.), IEEE Press, 157–169.

  • LeinbaughD.W., and M.-R.Yamini. Guaranteed response times in a distributed hard-real-time environment. 1986.IEEE Transactions on Software Engineering, SE12, 12 (Dec.), 1139–1144.

    Google Scholar 

  • LiuC.L. and J.W.Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment.Journal of the ACM, 20, 1 (Jan.), 46–61.

    Google Scholar 

  • Mork, A.K. 1984. The design of real-time programming systems based on process models.Proceedings of Real Time Systems Symposium (Dec.), IEEE Press, 5–16.

  • Pflügl, M., A. Damm, and W. Schwabl. 1989. Interprocess communication in MARS.Proc. of the ITG/GI Conference on Communication in Distributed Systems (Stuttgart, Feb.).

  • SenftCh., and R.Zainlinger. 1989. A graphical design environment for distributed real-time systems.Proceedings of the 22nd IEEE Conference on System Science (Kailua-Kona, Jan.), Washington, IEEE Computer Society Press, 871–880.

    Google Scholar 

  • Stoyenko, A.D. 1987. A real-time language with a schedulability analyzer. Technical Report CSRI-206 (Dec.), Computer Systems Research Institute, University of Toronto.

Download references

Author information

Authors and Affiliations

  1. Institut für Technische Informatik, Technische Universität Wien, A-1040, Vienna, Austria

    P. Puschner & Ch. Koza

Authors
  1. P. Puschner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ch. Koza
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Puschner, P., Koza, C. Calculating the maximum execution time of real-time programs. Real-Time Syst 1, 159–176 (1989). https://doi.org/10.1007/BF00571421

Download citation

  • Issue Date:

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

Keywords