1 Search Results for "Haupenthal, Florian"


Document
PRADA: Predictable Allocations by Deferred Actions

Authors: Florian Haupenthal and Jörg Herter

Published in: OASIcs, Volume 30, 13th International Workshop on Worst-Case Execution Time Analysis (2013)


Abstract
Modern hard real-time systems still employ static memory management. However, dynamic storage allocation (DSA) can improve the flexibility and readability of programs as well as drastically shorten their development times. But allocators introduce unpredictability that makes deriving tight bounds on an application's worst-case execution time even more challenging. Especially their statically unpredictable influence on the cache, paired with zero knowledge about the cache set mapping of dynamically allocated objects leads to prohibitively large overestimations of execution times when dynamic memory allocation is employed. Recently, a cache-aware memory allocator, called CAMA, was proposed that gives strong guarantees about its cache influence and the cache set mapping of allocated objects. CAMA itself is rather complex due to its cache-aware implementations of split and merge operations. This paper proposes PRADA, a lighter but less general dynamic memory allocator with equally strong guarantees about its influence on the cache. We compare the memory consumption of PRADA and CAMA for a small set of real-time applications as well as synthetical (de-) allocation sequences to investigate whether a simpler approach to cache awareness is still sufficient for the current generation of real-time applications.

Cite as

Florian Haupenthal and Jörg Herter. PRADA: Predictable Allocations by Deferred Actions. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 77-86, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


Copy BibTex To Clipboard

@InProceedings{haupenthal_et_al:OASIcs.WCET.2013.77,
  author =	{Haupenthal, Florian and Herter, J\"{o}rg},
  title =	{{PRADA: Predictable Allocations by Deferred Actions}},
  booktitle =	{13th International Workshop on Worst-Case Execution Time Analysis},
  pages =	{77--86},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-54-5},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{30},
  editor =	{Maiza, Claire},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.77},
  URN =		{urn:nbn:de:0030-drops-41243},
  doi =		{10.4230/OASIcs.WCET.2013.77},
  annote =	{Keywords: Dynamic Memory Allocation, Worst-Case Execution-Time, Cache Predictability}
}
  • Refine by Author
  • 1 Haupenthal, Florian
  • 1 Herter, Jörg

  • Refine by Classification

  • Refine by Keyword
  • 1 Cache Predictability
  • 1 Dynamic Memory Allocation
  • 1 Worst-Case Execution-Time

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2013

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail