Simple analysis of partial worst-case execution paths on general control flow graphs

2013 Proceedings of the International Conference on Embedded Software, EMSOFT 2013

Volumn , Issue , 2013, Pages

  Kleinsorge, Jan C ^a   Falk, Heiko ^b   Marwedel, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

Path analysis; Static analysis; Worst case execution time

Indexed keywords

CODES (SYMBOLS); DATA FLOW ANALYSIS; EMBEDDED SOFTWARE; EMBEDDED SYSTEMS; GRAPH THEORY; GRAPHIC METHODS; INTEGER PROGRAMMING; REGRESSION ANALYSIS; STATIC ANALYSIS;

COMPUTATIONAL MODEL; CONTROL FLOW GRAPHS; GRAPH TRANSFORMATION; INTEGER LINEAR PROGRAMS; PATH ANALYSIS; WORST-CASE EXECUTION; WORST-CASE EXECUTION TIME; WORST-CASE EXECUTION TIME ANALYSIS;

FLOW GRAPHS;

EID: 84892640727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMSOFT.2013.6658594     Document Type: Conference Paper

References (19)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
2. E. Althaus, S. Altmeyer, and R. Naujoks. Precise and Efficient Parametric Path Analysis. In Proc. of LCETS, 2011.
3. S. Altmeyer, C. Hümbert, B. Lisper, and R. Wilhelm. Parametric Timing Analysis for Complex Architectures. In Proc. of RTCSA, 2008.
4. S. Altmeyer, C. Maiza-Burguiére, and R. Wilhelm. Computing the Maximum Blocking Time for Scheduling with Deferred Preemption. In Proc. of STFSSD, 2009.
5. A. Colin and G. Bernat. Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis. In Proc. of ECRTS, 2002.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (3. ed.). MIT Press, 2009.
7. D. Eppstein. Finding the K Shortest Paths. In Proc. of FOCS, 1994.
8. A. Ermedahl. A Modular Tool Architecture for Worst-Case Execution Time Analysis. PhD thesis, Uppsala University, 2003.
9. P. Havlak. Nesting of Reducible and Irreducible Loops. TOPLAS, 19(4):557-567, 1997.
10. J. Janssen and H. Corporaal. Making Graphs Reducible with Controlled Node Splitting. TOPLAS, 19(6):1031-1052, 1997.
11. D. E. Knuth. The Art of Computer Programming, Vol. 3. Addison Wesley, 1998.
12. Y.-T. S. Li and S. Malik. Performance Analysis of Embedded Software using Implicit Path Enumeration. In Proc. of DAC, 1995.
13. S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
14. G. Ramalingam. On Loops, Dominators, and Dominance Frontiers. TOPLAS, 35(5):233-241, 2002.
15. F. Stappert, A. Ermedahl, and J. Engblom. Efficient Longest Executable Path Search for Programs with Complex Flows and Pipeline Effects. In Proc. of CASES, 2001.
16. R. E. Tarjan. A Unified Approach to Path Problems. J. ACM, 28(3):577-593, 1981.
17. H. Theiling, C. Ferdinand, and R. Wilhelm. Fast and Precise WCET Prediction by Separated Cache and Path Analyses. RTS, 18(2/3):157-179, 2000.
18. S. Unger and F. Mueller. Handling Irreducible Loops: Optimized Node Splitting versus DJ-Graphs. ACM Trans. Program. Lang. Syst., 24(4):299-333, July 2002.
19. R. Wilhelm, J. Engblom, et al. The Worst-Case Execution Time Problem - Overview of Methods and Survey of Tools. TECS, 7(3):36:1-36:53, 2008.