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 language | English |
---|---|
Title of host publication | Leveraging Applications of Formal Methods, Verification and Validation : 4th International Symposium On Leveraging Applications (ISoLA 2010) |
Number of pages | 498 |
Volume | 2 |
Publisher | Springer |
Publication date | 2010 |
Edition | 1 |
Pages | 464-478 |
ISBN (Print) | 978-3-642-16560-3 |
DOIs | |
Publication status | Published - 2010 |
Event | 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation - Amirande, Heraklion, Greece Duration: 18 Oct 2010 → 20 Oct 2010 Conference number: 4 http://www.isola-conference.org/isola2010/ |
Conference
Conference | 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation |
---|---|
Number | 4 |
Location | Amirande |
Country/Territory | Greece |
City | Heraklion |
Period | 18/10/2010 → 20/10/2010 |
Internet address |
Series | Lecture Notes in Computer Science |
---|---|
Number | 6416 |
ISSN | 0302-9743 |