Skip to main content
SpringerLink
Log in

Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems

  • Conference paper
  • First Online:
Languages, Compilers, and Tools for Embedded Systems (LCTES 2000)

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

Included in the following conference series:

Abstract

The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler’s admission tests and subsequently limits a task’s execution time during operation. If a task exceeds theWCET, this situation is detected and either a handler is invoked or control is transferred to a human operator. Such control systems usually support preemptive multitasking, and if an object-oriented programming language (e.g., Java, C++, Oberon) is used, then the system may also provide dynamic loading and unloading of software components (modules). Only modern, state-of-the art microprocessors can provide the necessary compute cycles, but this combination of features (preemption, dynamic un/loading of modules, advanced processors) creates unique challenges when estimating the WCET. Preemption makes it difficult to take the state of the caches and pipelines into account when determining the WCET, yet for modern processors, a WCET based on worst-case assumptions about caches and pipelines is too large to be useful, especially for big and complex real-time products. Since modules can be loaded and unloaded, each task must be analyzed in isolation, without explicit reference to other tasks that may execute concurrently.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Altenbernd. On the false path problem in hard real-time programs. In Proc. 8th Euromicro Workshop on Real-Time Systems, pages 102–107, L’Aquila, Italy, June 1996.

    Google Scholar 

  2. R. Brega. A real-time operating system designed for predictability and run-time safety. In Proc. 4th Int. Conf. Motion and Vibration Control (MOVIC), pages 379–384, Zurich, Switzerland, August 1998. ETH Zurich.

    Google Scholar 

  3. J. Busquets-Mataix and A. Wellings. Adding instruction cache effect to schedulability analysis of preemptive real-time systems. In Proc. 8th Euromicro Workshop on Real-Time Systems, pages 271–276, L’Aquila, June 1996.

    Google Scholar 

  4. C.-S. Cheng, J. Stankovic, and K. Ramamritham. Scheduling algorithms for hard real-time systems-A brief survey. In J. Stankovic and K. Ramamritham, editors, Tutorial on Hard Real-Time Systems, pages 150–173. IEEE Computer Society Press, 1988.

    Google Scholar 

  5. J. Dean, J. Hicks, C. Waldspurger, W. Weihl, and G. Chrysos. ProfileMe: Hardware support for instruction-level profiling on out-of-order processors. In Proc. 30th Annual IEEE/ACM Int. Symp. on Microarchitecture (MICRO-97), pages 292–302, LosAlamitos, CA, December 1997. IEEE Computer Society.

    Google Scholar 

  6. D. Diez and S. Vestli. D’nia an object oriented real-time system. Real-Time Magazine, (3):51–54, March 1995.

    Google Scholar 

  7. P. Emma. Understanding some simple processor-performance limits. IBM J. Research and Development, 43(3):215–231, 1997.

    Google Scholar 

  8. C. Healy, R. Arnold, F. Mueller, D. Whalley, and M. Harmon. Bounding pipeline and instruction cache performance. IEEE Trans. Computers, 48(1):53–70, January 1999.

    Article  Google Scholar 

  9. C. Healy, M. Sjödin, V. Rustagi, and D. Whalley. Bounding loop iterations for timing analysis. In Proc. 4th Real-Time Technology and Applications Symp., pages 12–21, Denver, Colorado, June 1998.

    Google Scholar 

  10. C. Healy and D. Whalley. Tighter timing predictions by automatic detection and exploitation of value-dependent constraints. In Proc. 5th Real-Time Technology and Applications Symp., pages 79–88, Vancouver, Canada, June 1999.

    Google Scholar 

  11. M. Honegger, R. Brega, and G. Schweitzer. Application of a nonlinear adaptive controller to a 6 dof parallel manipulator. In Proc. IEEE Int. Conf. Robotics and Automation, pages 1930–1935, San Francisco CA, April 2000. IEEE.

    Google Scholar 

  12. IBM Microelectronic Division and Motorola Inc. PowerPC 604/604e RISC Microprocessor User’s Manual, 1998.

    Google Scholar 

  13. S.-K. Kim, S. Min, and Ha R. Efficient worst case timing analysis of data caching. In Proc. 2nd 1996 IEEE Real-Time Technology and Applications Symposium, pages 230–240, Boston, MA, June 1996. IEEE.

    Google Scholar 

  14. D. Kirk. SMART (Strategic Memory Allocation for Real-Time) cache design. In Proc. 10th IEEE Real-Time Systems Symp., pages 229–239, Santa Monica, California, December 1989. IEEE.

    Google Scholar 

  15. E. Kligerman and A. Stoyenko. Real-time Euclid:A language for reliable real-time systems. IEEE Trans. on Software Eng., 12(9):941–949, September 1986.

    Google Scholar 

  16. L. Ko, C. Healy, E. Ratliff, R. Arnold, D. Whalley, and M. Harmon. Supporting the specification and analysis of timing constraints. In Proc. 2nd IEEE Real-Time Technology and Applications Symp., pages 170–178, Boston, MA, June 1996. IEEE.

    Google Scholar 

  17. C.-G. Lee, J. Hahn, Y.-M. Seo, S. Min, R. Ha, S. Hong, C. Park, M. Lee, and C. Kim. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. In Proc. 17th IEEE Real-Time Systems Symp., pages 264–274,Washington, D.C., December 1996. IEEE.

    Google Scholar 

  18. F. Levine and C. Roth. A programmer’s view of performance monitoring in the PowerPC microprocessor. IBM J. Research and Development, 41(3):345–356, May 1997.

    Article  Google Scholar 

  19. Y.-T. Li, S. Malik, and A. Wolfe. Cache modeling for real-time software: Beyond directed mapped instructions caches. In Proc. 17th IEEE Real-Time Systems Symp., pages 254–263, Washington, D.C., December 1996. IEEE.

    Google Scholar 

  20. J. Liedtke, H. Härtig, and M. Hohmuth. OS-controlled cache predictability for real-time systems. In Proc. 3rd IEEE Real-Time Technology and Applications Symp., Montreal, Canada, June 1997. IEEE.

    Google Scholar 

  21. S.-S. Lim, Y. Bae, G. Jang, B.-D. Rhee, S. Min, C. Park, H. Shin, K. Park, S.-M. Moon, and C.-S. Kim. An accurate worst case timing analysis for RISC processors. IEEE Trans. on Software Eng., 21(7):593–604, July 1995.

    Article  Google Scholar 

  22. S.-S. Lim, J. Han, J. Kim, and S. Min. A worst case timing analysis technique for multipleissue machines. In Proc. 19th IEEE Real-Time Systems Symp., pages 334–345, Madrid, Spain, December 1998. IEEE.

    Google Scholar 

  23. A. Mok and G. Liu. Efficient runtime monitoring of timing constraints. In Proc. 3rd Real-Time Technology and Applications Symp., Montreal, Canada, June 1997.

    Google Scholar 

  24. H. Mössenböck and N. Wirth. The programming language Oberon-2. Structured Programming, 12(4), 1991.

    Google Scholar 

  25. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, 1997.

    Google Scholar 

  26. F. Müller and J. Wegener. A comparison of static analysis and evolutionary testing for the verification of timing constraints. In Proc. 19th Real Time Technology and Applications Symp., pages 179–188, Madrid, Spain, June 1998. IEEE.

    Google Scholar 

  27. C. Park. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems, (5):31–62, 1993.

    Google Scholar 

  28. P. Puschner and C. Koza. Calculating the maximum execution time of real-time programs. J. Real-Time Systems, 1(2):160–176, September 1989.

    Google Scholar 

  29. P. Puschner and R. Nossal. Testing the results of static worst-case execution-time analysis. In Proc. 19th Real-Time Systems Symp., pages 134–143, Madrid, Spain, December 1998. IEEE.

    Google Scholar 

  30. P. Puschner and A. Vrchoticky. Problems in static worst-case execution time analysis. In 9. ITG/GI-Fachtagung Messung, Modellierung und Bewertung von Rechen-und Kommunikationssystemen, Kurzbeiträge und Toolbeschreibungen, pages 18–25, Freiberg, Germany, September 1997.

    Google Scholar 

  31. F. Stappert and P. Altenbernd. Complete worst-case execution time analysis of straight-line hard real-time programs. J. System Architecture, 46(4):339–335, April 2000.

    Article  Google Scholar 

  32. H. Theiling and C. Ferdinand. Combining abstract interpretation and ILP for microarchitecture modelling and program path analysis. In Proc. 19th IEEE Real-Time Systems Symp., pages 144–153, Madrid, Spain, December 1998. IEEE.

    Google Scholar 

  33. N. Wirth and J. Gutknecht. Project Oberon — The Design of an Operating System and Compiler. ACM Press, NewYork, 1992.

    Google Scholar 

  34. N. Zhang, A. Burns, and M. Nicholson. Pipelined processors and worst case execution times. Real-Time Systems, 5(4):319–343, October 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departement Informatik, ETH Zürich, CH 8092, Zürich

    Matteo Corti & Thomas Gross

  2. Institute of Robotics, ETH Zürich, CH 8092, Zürich

    Roberto Brega

Authors
  1. Matteo Corti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Brega
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Gross
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Virginia, School of Engineering and Applied Science, 22903-2442, VA, Charlottesville, USA

    Jack Davidson

  2. Department of Computer Engineering, Seoul National University, 151-742, Seoul, Korea

    Sang Lyul Min

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corti, M., Brega, R., Gross, T. (2001). Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems. In: Davidson, J., Min, S.L. (eds) Languages, Compilers, and Tools for Embedded Systems. LCTES 2000. Lecture Notes in Computer Science, vol 1985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45245-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45245-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41781-1

  • Online ISBN: 978-3-540-45245-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation