License
when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2009.2284
URN: urn:nbn:de:0030-drops-22846
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2284/
Herter, Jörg ; Reineke, Jan

Making Dynamic Memory Allocation Static to Support WCET Analysis

pdf-format:
Dokument 1.pdf (204 KB)

Abstract

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.

BibTeX - Entry

@InProceedings{herter_et_al:DSP:2009:2284,
  author =	{J{\"o}rg Herter and Jan Reineke},
  title =	{Making Dynamic Memory Allocation Static to Support WCET Analysis},
  booktitle =	{9th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis},
  year =	{2009},
  editor =	{Niklas Holsti},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2284},
  annote =	{Keywords: WCET analysis, dynamic memory allocation, heap},
  ISBN =	{978-3-939897-14-9},
  note =	{also published in print by Austrian Computer Society (OCG) with ISBN 978-3-85403-252-6}
}

Keywords: WCET analysis, dynamic memory allocation, heap
Seminar: 9th International Workshop on Worst-Case Execution Time Analysis (WCET'09)
Issue date: 2009
Date of publication: 26.11.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI