Combining worst-case timing models, loop unrolling, and static loop analysis for WCET minimization

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2009, Pages 35-44

  Lokuciejewski, Paul ^a   Marwedel, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADVERSE EFFECT; AVERAGE-CASE; HIGH-PERFORMANCE ARCHITECTURE; INSTRUCTION CACHES; LOOP ANALYSIS; LOOP ITERATION; LOOP UNROLLING; OPTIMIZATION LOOP; OPTIMIZATION POTENTIAL; PROGRAM PERFORMANCE; SPILL CODE; TIMING MODELS; WORST-CASE EXECUTION TIME;

OPTIMIZATION; PROGRAM COMPILERS; STRUCTURED PROGRAMMING;

REAL TIME SYSTEMS;

EID: 70449640272     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2009.9     Document Type: Conference Paper

References (30)

1. AbsInt Angewandte Informatik GmbH. Worst-Case Execution Time Analyzer aiT for TriCore. 2009.
2. D. F. Bacon, S. L. Graham, and O. J. Sharp. Compiler Transformations for High-performance Computing. ACM Comput. Surv., 26(4):345-420, 1994.
3. P. Briggs. Register Allocation Via Graph Coloring. PhD thesis, Houston, TX, USA, 1992.
4. A. M. Campoy, I. Puaut, and A. P. I. et al. Cache Contents Selection for Statically-Locked Instruction Caches: An Algorithm Comparison. In Proc. of ECRTS, 2005.
5. S. Carr and Y. Guan. Unroll-and-Jam Using Uniformly Generated Sets. In Proc. of MICRO, 1997.
6. S. Carr and K. Kennedy. Improving the Ratio of Memory Operations to Floating-Point Operations in Loops. ACM Trans. Program. Lang. Syst., 16(6), 1994.
7. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In POPL, 1977.
8. J. W. Davidson and S. Jinturkar. An Aggressive Approach to Loop Unrolling. Technical report, 2001.
9. J.-F. Deverge and I. Puaut. WCET-Directed Dynamic Scratchpad Memory Allocation of Data. In Proc. of ECRTS, 2007.
10. H. Falk, P. Lokuciejewski, and H. Theiling. Design of a WCET-Aware C Compiler. In Proc. of ESTIMedia, 2006.
11. H. Falk, S. Plazar, and H. Theiling. Compile-Time Decided Instruction Cache Locking using Worst-Case Execution Paths. In Proc. of CODES+ISSS, 2007.
12. D. W. Goodwin and K. D. Wilken. Optimal and Near-Optimal Global Register Allocations Using 0-1 Integer Programming. Softw. Pract. Exper., 26(8), 1996.
13. K. Heydemann, F. Bodin, and P. M.W. Knijnenburg. Global Trade-Off between Code Size and Performance for Loop Unrolling on Vliw Architectures. Technical report, 2001.
14. A. Koseki, H. Komastu, and Y. Fukazawa. A Method for Estimating Optimal Unrolling Times for Nested Loops. In Proc. of ISPAN, 1997.
15. D. M. Lavery and W.-M. W. Hwu. Unrolling-based Optimizations forModulo Scheduling. In Proc. ofMICRO, 1995.
16. C. Lee, M. Potkonjak, and W. H. Mangione-Smith. Media-Bench: A Tool for Evaluating and Synthesizing Multimedia and Communications Systems. In Proc. of MICRO, 1997.
17. P. Lokuciejewsi, H. Falk, P. Marwedel, and T. Henrik. WCET-Driven, Code-Size Critical Procedure Cloning. In Proc. of SCOPES, 2008.
18. P. Lokuciejewski, H. Falk, and P. Marwedel. WCET-driven Cache-based Procedure Positioning Optimizations. In Proc. of ECRTS, 2008.
19. Lokuciejewski, Paul and Cordes, Daniel and Falk, Heiko and Marwedel, Peter. A Fast and Precise Static Loop Analysis based on Abstract Interpretation, Program Slicing and Polytope Models. In Proc. of CGO, 2009.
20. S. A. Mahlke, W. Y. Chen, J. C. Gyllenhaal, and W.-M. W. Hwu. Compiler Code Transformations for Superscalarbased High Performance Systems. In Proc. of Supercomputing, 1992.
21. Mälardalen WCET Research Group. Mälardalen WCET Benchmark Suite. http://www.mrtc.mdh.se/projects/wcet, 2009.
22. S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers Inc., 1997.
23. I. Puaut and C. Pais. Scratchpad Memories vs Locked Caches in Hard Real-Time Systems: a Quantitative Comparison. In Proc. of DATE, 2007.
24. V. Sarkar. Optimized Unrolling of Nested Loops. Int. J. Parallel Program., 29(5):545-581, 2001.
25. L. Song and K. Kavi. What Can We Gain by Unfolding Loops? SIGPLAN Not., 39(2), 2004.
26. V. Suhendra, T. Mitra, A. Roychoudhury, and T. Chen. WCET Centric Data Allocation to Scratchpad Memory. In Proc. of RTSS, 2005.
27. UTDSP Benchmark Suite. http://www.eecg.toronto.edu/~corinna/DSP/ infrastructure/UTDSP.html, January 2009.
28. C. S. V. Zivojnovic, J. Martinez and H. Meyr. DSPstone: A DSP-Oriented Benchmarking Methodology. In Proc. Of ICSPAT, 1994.
29. X. Vera, B. Lisper, and J. Xue. Data Cache Locking for Higher Program Predictability. In Proc. of SIGMETRICS, 2003.
30. W. Zhao,W. Kreahling, D. Whalley, et al. ImprovingWCET by Optimizing Worst-Case Paths. In Proc. of RTAS, 2005.