Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduced by standard memory allocators. To overcome this problem, algorithms have been proposed that precompute static allocations for dynamically allocating programs with known numeric bounds on the number and sizes of allocated memory blocks. In this paper, we present a novel algorithm for computing such static allocations that can cope with parametric bounds on the number and sizes of allocated blocks. To demonstrate the usefulness of our approach, we precompute static allocations or a set of existing real-time applications and academic examples.
@InProceedings{herter_et_al:OASIcs.WCET.2010.124, author = {Herter, J\"{o}rg and Altmeyer, Sebastian}, title = {{Precomputing Memory Locations for Parametric Allocations}}, booktitle = {10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010)}, pages = {124--135}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-21-7}, ISSN = {2190-6807}, year = {2010}, volume = {15}, editor = {Lisper, Bj\"{o}rn}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2010.124}, URN = {urn:nbn:de:0030-drops-28320}, doi = {10.4230/OASIcs.WCET.2010.124}, annote = {Keywords: WCET analysis, cache analysis, dynamic/static memory allocation} }
Feedback for Dagstuhl Publishing