2026-07-24T00:02:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2832 2024-03-06T10:28:45Z ddc:004 open_access

Precomputing Memory Locations for Parametric Allocations Herter, Jörg Altmeyer, Sebastian WCET analysis cache analysis dynamic/static memory allocation 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jörg Herter and Sebastian Altmeyer 2010 Is Part Of OASIcs, Volume 15, 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2010.124 urn:nbn:de:0030-drops-28320 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2010.124 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode