[Back]

W. Puffitsch, B. Huber, M. Schoeberl:
"Worst-Case Analysis of Heap Allocations";
Talk: 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2010), Heraklion, Griechenland; 2010-10-18 - 2010-10-20; in: "Worst-Case Analysis of Heap Allocations", Lecture Notes in Computer Science, 6416 (2010), 464 - 478.

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.

Worst-Case Analysis, Memory Allocation, Real-Time Java

http://dx.doi.org/10.1007/978-3-642-16561-0_42