Making Dynamic Memory Allocation Static to Support WCET Analysis
Jörg Herter, Jan Reineke · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2009
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictable cache performance when standard memory allocators are used. We present algorithms to compute a static allocation for programs using dynamic memory allocation. Our algorithms strive to produce static allocations that lead to minimal WCET times in a subsequent WCET analyses. Preliminary experiments suggest that static allocations for hard real-time applications can be computed at reasonable computational costs.