Real-Time Systems

, Volume 18, Issue 2–3, pp 115–128 | Cite as

Guest Editorial: A Review of Worst-Case Execution-Time Analysis

  • Peter Puschner
  • Alan Burns
Article

Keywords

Operating System Computing Methodology Guest Editorial 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alt, M., Ferdinand, C., Martin, F., and Wilhelm, R. 1996. Cache behavior prediction by abstract interpretation. Proc. of the Static Analysis Symposium, LNCS 1145: 52–66.Google Scholar
  2. Altenbernd, P. 1996. On the false path problem in hard real-time programs. Proc. Euromicro Workshop on Real-Time Systems, L'Aquila, Italy.Google Scholar
  3. Amerasinghe, P. 1985. A Universal Hardware Simulator. Dept. of Computer Sciences, University of Texas, Austin, TX, USA. Undergraduate Honors Thesis.Google Scholar
  4. Blieberger, J. 1994. Discrete loops and worst case performance. Computer Languages 20(3): 193–212.Google Scholar
  5. Blieberger, J., and Lieger, R. 1996. Worst-case space and time complexity of recursive procedures. Real-Time Systems 11(2): 115–144.Google Scholar
  6. Chapman, R., Burns, A., and Wellings, A. 1996. Combining static worst-case timing analysis and program proof. Real-Time Systems 11(2): 145–171.Google Scholar
  7. Chapman, R., Burns, A., and Wellings, A. J. 1993. Worst-case timing analysis of exception handling in Ada. In Ada: Towards Maturity. Proceedings of the 1993 AdaUK Conference, Collingbourne, L., ed., pp. 148–164.Google Scholar
  8. Chapman, R., Burns, A., and Wellings, A. J. 1994. Integrated program proof and worst-case timing analysis of SPARK Ada. ACM Workshop on Language, Compiler and Tool Support for Real-Time Systems.Google Scholar
  9. Chen, M. 1987. A Timing Analysis Language-(TAL). Dept. of Computer Sciences, University of Texas, Austin, TX, USA. Programmer's Manual.Google Scholar
  10. Engblom, J., Ermedahl, A., and Altenbernd, P. 1998. Facilitatingworst-case execution times analysis for optimized code. Proc. Euromicro Workshop on Real-Time Systems, Berlin, Germany, pp. 146–153.Google Scholar
  11. Harmon, M. G. 1991. Predicting Execution Time on Contemporary Computer Architectures. Ph.D. thesis, Department of Computer Science, Florida State University, Tallahassee, FL, USA.Google Scholar
  12. Harmon, M. G., Baker, T. P., and Whalley, D. B. 1992. A retargetable technique for predicting execution time. Proc. 13th Real-Time Systems Symposium, Phoenix, AZ, USA, pp. 68–77.Google Scholar
  13. Healy, C., Sjödin, M., Rustagi, V., and Whalley, D. 1998. Bounding loop iterations for timing analysis. Proceedings of the IEEE Real-Time Technology and Applications Symposium, Denver, CO, pp. 12–21.Google Scholar
  14. Healy, C. A., Arnold, R. D., Mueller, F., Whalley, D., and Harmon, M. G. 1999. Bounding pipeline and instruction cache performance. IEEE Transaction on Computers 48(1): 53–70.Google Scholar
  15. Healy, C. A., Whalley, D. B., and Harmon, M. G. 1995. Integrating the timing analysis of pipelining and instruction xaching. Proc. 16th Real-Time Systems Symposium: 288–297.Google Scholar
  16. Hur, Y., Bae, Y. H., Kin, S., Rhee, B., Min, W. L., Park, C. Y., Lee, M., Shin, H., and Kim, C. S. 1995. Worst case timing analysis of RISC processors: R3000/R3010 case study. Proc. 16th Real-Time Systems Symposium: 308–319.Google Scholar
  17. Kim, S., Min, S. L., and Ha, R. 1996. Efficient worst case timing analysis of data caching. Proceedings of the IEEE Real-Time Technology and Applications Symposium: 230–240.Google Scholar
  18. Kligerman, E., and Stoyenko, A. 1986. Real-time euclid: A language for reliable real-time systems. IEEE Transactions on Software Engineering SE-12(9): 941–949.Google Scholar
  19. Ko, L., Healy, C., Ratliff, E., and Harmon, M. 1996. Supporting the specification and analysis of timing constraints. Proceedings of the IEEE Real-Time Technology and Applications Symposium: 170–178.Google Scholar
  20. Li, Y. S., and Malik, S. 1995. Performance analysis of embedded software using implicit path enumeration. Proc. of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Real-Time Systems, La Jolla, CA, USA, pp. 95–105.Google Scholar
  21. Li, Y. S., Malik, S., and Wolfe, A. 1995. Efficient microarchitecture modeling and path analysis for real-time software. Proc. 16th Real-Time Systems Symposium: 298–307.Google Scholar
  22. Li, Y. S., Malik, S., and Wolfe, A. 1996. Cache modeling for real-time software: Beyond direct mapped instruction caches. Proc. 17th Real-Time Systems Symposium.Google Scholar
  23. Lim, S., Bea, Y. H., Jang, G. T., Rhee, B., Min, S. L., Park, C. Y., Shin, H., and Kim, C. S. 1994. An accurate worst case timing analysis for RISC processors. Proc. 15th Real-Time Systems Symposium: 97–108.Google Scholar
  24. Lim, S., Han, J. H., Kim, J., and Min, S. L. 1998. A worst case timing analysis technique for multiple-issue machines. Proc. 19th Real-Time Systems Symposium: 334–345.Google Scholar
  25. Mok, A. K., Amerasinghe, P., Chen, M., and Tantisirivat, K. 1989. Evaluating tight execution time bounds of programs by annotations. Proc. 6th IEEE Workshop on Real-Time Operating Systems and Software, Pittsburgh, PA, USA, pp. 74–80.Google Scholar
  26. Mueller, F. 1997. Generalizing timing predictions to set-associative caches. Proc. Euromicro Workshop on Real-Time Systems, Toledo, Spain, pp. 64–71.Google Scholar
  27. Niehaus, D. 1991. Program representation and translation for predictable real-time systems. Proc. 12th Real-Time Systems Symposium: 53–63.Google Scholar
  28. Niehaus, D., Nahum, E., and Stankovic, J. A. 1991. Predictable real-time caching in the spring system. Proc. 8th IEEE Workshop on Real-Time Operating Systems and Software, Atlanta, GA, USA, pp. 80–87.Google Scholar
  29. Park, C. Y. 1992. Predicting deterministic execution time of real-time programs. Ph.D. thesis, Department of Computer Science and Engineering, University of Washington, Seattle, WA, USA.Google Scholar
  30. Park, C. Y. 1993. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems 5(1): 31–62.Google Scholar
  31. Park, C. Y., and Shaw, A. C. 1991. Experiments with a program timing tool based on source-level timing schema. IEEE Computer 24(5): 48–57.Google Scholar
  32. Pospischil, G., Puschner, P., Vrchoticky, A., and Zainlinger, R. 1992. Developing real-time tasks with predictable timing. IEEE Software 9(5): 35–44.Google Scholar
  33. Puschner, P. 1998a. A tool for high-level language analysis of worst-case execution times. Proc. Euromicro Workshop on Real-Time Systems, Berlin, Germany, pp. 130–137.Google Scholar
  34. Puschner, P. 1998b. Worst-case execution time analysis at low cost. Control Engineering Practice 6(1): 129–135.Google Scholar
  35. Puschner, P., and Koza, C. 1989. Calculating the maximum execution time of real-time programs. Real-Time Systems 1(2): 159–176.Google Scholar
  36. Puschner, P., and Schedl, A. 1993. A tool for the computation of worst case task execution times. Proc. Euromicro Workshop on Real-Time Systems, Oulu, Finland, pp. 224–229.Google Scholar
  37. Puschner, P., and Schedl, A. 1997. Computing maximum task execution times-A graph-based approach. Real-Time Systems 13(1): 67–91.Google Scholar
  38. Puschner, P., and Vrchoticky, A. 1991. An assessment of task execution time analysis. Proc. 10th IFAC Workshop on Distributed Computer Control Systems, Semmering, Austria, pp. 41–45. Published by Pergamon Press, Oxford, New York, 1992.Google Scholar
  39. Shaw, A. C. 1989. Reasoning about time in higher-level language software. IEEE Transactions on Software Engineering SE-15(7): 875–889.Google Scholar
  40. Stankovic, J. A., and Ramamritham, K. 1991. The spring kernel: A new paradigm for real-time operating systems. IEEE Software: 62–72.Google Scholar
  41. Stappert, F. 1997. Predicting pipelining and caching behaviour of hard real-time programs. Proc. Euromicro Workshop on Real-Time Systems, Toledo, Spain, pp. 80–86.Google Scholar
  42. Stoyenko, A. 1987. A Real-Time LanguageWith A Schedulability Analyzer. Computer Systems Research Institute, University of Toronto, Canada. Dissertation.Google Scholar
  43. Stoyenko, A., Hamacher, V., and Holt, R. 1991. Analyzing hard-real-time programs for guaranteed schedulability. IEEE Transactions on Software Engineering SE-17(8): 737–750.Google Scholar
  44. Theiling, H., and Ferdinand, C. 1998. Combining abstract interpretation and ILP for microarchitecture modelling and program path analysis. Proc. 19th Real-Time Systems Symposium, Madrid, Spain, pp. 144–153.Google Scholar
  45. Vrchoticky, A. 1994. Compilation support for fine-grained execution time analysis. Proceedings of the ACM SIGPLAN Workshop on Language, Compiler and Tool Support for Real-Time Systems, Orlando FL.Google Scholar
  46. Zhang, N., Burns, A., and Nicholson, M. 1993. Pipelined processors and worst case execution times. Real-Time Systems 5(4): 319–343.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Peter Puschner
    • 1
  • Alan Burns
    • 2
  1. 1.Institut für Technische InformatikTechnische Universität WienWienAustria
  2. 2.Department of Computer ScienceUniversity of YorkYorkUnited Kingdom

Personalised recommendations