Worst-case analysis of heap allocations

Wolfgang Puffitsch, Benedikt Huber, Martin Schoeberl

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    368 Downloads (Pure)

    Abstract

    In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst-case execution time and the worst-case memory consumption. In this paper, we present an analysis to determine the worst-case heap allocations of tasks. The analysis builds upon techniques that are well established for worst-case execution time analysis. The difference is that the cost function is not the execution time of instructions in clock cycles, but the allocation in bytes. In contrast to worst-case execution time analysis, worst-case heap allocation analysis is not processor dependent. However, the cost function depends on the object layout of the runtime system. The analysis is evaluated with several real-time benchmarks to establish the usefulness of the analysis, and to compare the memory consumption of different object layouts.
    Original languageEnglish
    Title of host publicationLeveraging Applications of Formal Methods, Verification and Validation : 4th International Symposium On Leveraging Applications (ISoLA 2010)
    Number of pages498
    Volume2
    PublisherSpringer
    Publication date2010
    Edition1
    Pages464-478
    ISBN (Print)978-3-642-16560-3
    DOIs
    Publication statusPublished - 2010
    Event4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation - Amirande, Heraklion, Greece
    Duration: 18 Oct 201020 Oct 2010
    Conference number: 4
    http://www.isola-conference.org/isola2010/

    Conference

    Conference4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation
    Number4
    LocationAmirande
    CountryGreece
    CityHeraklion
    Period18/10/201020/10/2010
    Internet address
    SeriesLecture Notes in Computer Science
    Number6416
    ISSN0302-9743

    Fingerprint Dive into the research topics of 'Worst-case analysis of heap allocations'. Together they form a unique fingerprint.

    Cite this