skip to main content
research-article
Free Access

Computation takes time, but how much?

Published:01 February 2014Publication History
Skip Abstract Section

Abstract

Timing analysis for hard real-time systems.

References

  1. Althaus, E., Altmeyer, S. and Naujoks, R. Precise and efficient parametric path analysis. In Proceedings of the ACM SIGPLAN/SIGBED 2011 Conference on Languages, Compilers, and Tools for Embedded Systems. ACM, NY (Apr. 2011), 141--150. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Altmeyer, S., Davis, R.I. and Maiza, C. Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. Real-Time Systems 48, 5 (2012), 499--526. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Axer, P. et al. Building timing predictable embedded systems. Trans. Embedded Computing Systems (2012).Google ScholarGoogle Scholar
  4. Balakrishnan, G. and Reps, T. WYSINWYX: What you see is not what you eXecute. ACM Trans. Program. Lang. Syst. 32, 6 (Aug. 2010), 23:1--23:84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Bernardes, J.N.C. On the predictability of discrete dynamical systems. In Proc. of the American Math. Soc. 130, 7 (2001), 1983--1992.Google ScholarGoogle Scholar
  6. Cousot, P. Abstract interpretation based formal methods and future challenges. Informatics---10 Years Back, 10 Years Ahead (2001), 138--156. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cullmann, C. et al. Predictability considerations in the design of multi-core embedded systems. In Proceedings of Embedded Real Time Software and Systems (May 2010), 36--42.Google ScholarGoogle Scholar
  8. Ferdinand, C. et al. Reliable and precise WCET determination for a real-life processor. In Proceedings of the First International Workshop on Embedded Software (London, U.K., 2001). Springer, 469--485. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ferdinand, C. et al. Combining a high-level design tool for safety-critical systems with a tool for WCET analysis on executables. In Proceedings of the 4th European Congress ERTS Embedded Real-Time Software (Toulouse, France, Jan. 2008).Google ScholarGoogle Scholar
  10. Ferdinand, C. and Wilhelm, R. Efficient and precise cache behavior prediction for real-time systems. Real-Time Systems 17, 2-3 (1999), 131--181. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Grund, D. Static Cache Analysis for Real-Time Systems---LRU, FIFO, PLRU. Ph.D. thesis. Saarland University, 2012.Google ScholarGoogle Scholar
  12. Grund, D., Reineke, J. and Gebhard, G. Branch target buffers: WCET analysis framework and timing predictability. J. Systems Architecture 57, 6 (2011), 625--637. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Gustafsson, J., Betts, A. Ermedahl, A. and Lisper, B. The Mälardalen WCET benchmarks: Past, present and future. In Proceedings of the 10th International Workshop on Worst-Case Execution Time Analysis.Google ScholarGoogle Scholar
  14. Gustafsson, J., Ermedahl, A., Sandberg, C. and Lisper, B. Automatic derivation of loop bounds and infeasible paths for WCET analysis using abstract execution. In Proceedings of the 27th IEEE International Real-Time Systems Symposium (Washington, D.C., 2006), IEEE-CS, 57--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Healy, C. Sjödin, M., Rustagi, V., Whalley, D. and van Engelen, R. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems 18 (2000), 129--156. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Healy, C. and Whalley, D. Automatic detection and exploitation of branch constraints for timing analysis. IEEE Trans. Software Engineering 28, 8 (2002), 763--781. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Henzinger, T. Two challenges in embedded systems design: Predictability and robustness. Philos. Trans. Royal Soc. Math., Phys. and Engin. Sciences, 366, 1881 (2008), 3727--3736.Google ScholarGoogle ScholarCross RefCross Ref
  18. Kästner, D. et al. Leveraging from the combination of model-based analysis and testing. Embedded World Congress, 2013.Google ScholarGoogle Scholar
  19. Kästner, D., Ferdinand, C., Heckmann, R., Jersak, M. and Gliwa, P. An integrated timing analysis methodology for real-time systems. SAE World Congress. SAE International, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  20. Kästner, D. et al. Integrating model-based code generators with static program analyzers. Embedded World Congress, 2013.Google ScholarGoogle Scholar
  21. Kästner, D. et al. Meeting real-time requirements with multi-core processors. In Proceedings of 2012 Workshop: Next Generation of System Assurance Approaches for Safety-Critical Systems. (Sept. 2012). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Kästner, D. and Ferdinand, C. Efficient verification of non-functional safety properties by abstract interpretation: Timing, stack consumption, and absence of runtime errors. In Proceedings of the 29th International System Safety Conference (Las Vegas, 2011).Google ScholarGoogle Scholar
  23. Lee, E.A. Computing needs time. Commun. ACM 52, 5 (May 2009), 70--79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Li, Y-T.S. and Malik, S. Performance analysis of embedded software using implicit path enumeration. In Proceedings of the 32nd Annual ACM/IEEE Design Automation Conference (New York, NY, 1995), ACM, NY, 456--461. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Lundqvist, T. and Stenström, P. Timing anomalies in dynamically scheduled microprocessors. In Proceedings of the 20th IEEE Real-Time Systems Symposium (Dec. 1999), 12--21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Martin, F., Alt, M., Wilhelm, R. and Ferdinand, C. Analysis of loops. Compiler Construction (1998), 80--94. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. National Highway Traffic Safety Administration Toyota unintended acceleration investigation. Technical Report TI-10-00618, NASA Engineering and Safety Center, January 2011.Google ScholarGoogle Scholar
  28. Puschner, P. and Burns, A. Guest editorial: A review of worst-case execution-time analysis. Real-Time Systems 18 (2000), 115--128. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Reineke, J. and Grund, D. Sensitivity of cache replacement policies. ACM Trans. Embedded Computing Systems (2013). Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Reineke, J. et al. A definition and classification of timing anomalies. In Proceedings of 6th International Workshop on Worst-Case Execution Time Analysis (July 2006).Google ScholarGoogle Scholar
  31. Schlickling, M. and Pister, M. Semi-automatic derivation of timing models for WCET analysis. In Proceedings of the ACM SIGPLAN/SIGBED 2010 Conference on Languages, Compilers, and Tools for Embedded Systems (Apr. 2010), 67--76. ACM, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Schranzhofer, A. Pellizzoni, R., Chen, J.-J., Thiele, L. and Caccamo, M. Timing analysis for resource access interference on adaptive resource arbiters. IEEE Real-Time and Embedded Technology and Applications Symposium (2011), 213--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Shaw, A.C. Reasoning about time in higher-level language software. IEEE Trans. Software Eng. 15, 7 (1989), 875--889. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Souyris, J. Industrial experience of abstract interpretation-based static analyzers. Building the Information Society. R. Jacquart, ed. IFIP 156 (2004), 393--400. Springer, Boston.Google ScholarGoogle Scholar
  35. Souyris, J., Pavec, E.L., Himbert, G., Jégu, V. and Borios, G. Computing the worst-case execution time of an avionics program by abstract interpretation. In Proceedings of the 5th Intl. Workshop on Worst-Case Execution Time Analysis (2005), 21--24.Google ScholarGoogle Scholar
  36. Stankovic, J. and Ramamritham, K. What is predictability for real-time systems? Real-Time Syst. 2 (1990), 247--254. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Tan, L. The worst-case execution time tool challenge 2006. International J. Software Tools for Technology Transfer 11, 2 (2009), 133--152. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Theiling, H. Extracting safe and precise control flow from binaries. In Proceedings of the 7th International Conference on Real-Time Systems and Applications (Washington, D.C. 2000). IEEE-CS, 23--30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Theiling, H. ILP-based interprocedural path analysis. Lecture Notes in Computer Science, EMSOFT 2491 (2002), 349--363. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Thesing, S. Safe and Precise WCET Determinations by Abstract Interpretation of Pipeline Models. Ph.D. thesis, Saarland University, 2004.Google ScholarGoogle Scholar
  41. Thesing, S. et al. An abstract interpretation-based timing validation of hard real-time avionics software systems. In Proceedings of the 2003 International Conference on Dependable Systems and Networks (June 2003), IEEE-CS, 625--632.Google ScholarGoogle Scholar
  42. Thiele, L. and Wilhelm, R. Design for timing predictability. Real-Time Systems, 28, 2-3 (2004), 157--177. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Wilhelm, R. et al. The worst-case execution-time problem---Overview of methods and survey of tools. ACM Trans. Embedded Computing Systems 7, 3 (2008), 1--53. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Wilhelm, R. et al. Memory hierarchies, pipelines, and buses for future time-critical embedded architectures. IEEE TCAD 28, 7 (July 2009), 966--978. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Computation takes time, but how much?

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Communications of the ACM
            Communications of the ACM  Volume 57, Issue 2
            February 2014
            103 pages
            ISSN:0001-0782
            EISSN:1557-7317
            DOI:10.1145/2556647
            • Editor:
            • Moshe Y. Vardi
            Issue’s Table of Contents

            Copyright © 2014 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 February 2014

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Popular
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDFChinese translation

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format .

          View HTML Format