Poor data layout in memory may generate weak data locality and poor
performance. Code transformations such as loop blocking or
interchanging and array padding have addressed this issue for
scientific applications.  However many generalist applications do not
use data arrays, but dynamically allocated heterogeneous data
structures.
<p>
In this paper, we explore two data layout techniques for dynamically
allocated data structures: field reorganization, and instance
interleaving.  The application of these techniques may be guided by
program profiling.  This allows significant cache behavior
improvements on some applications.
<p>
To support instance interleaving, we developed a specific memory
allocation library called ialloc. An ialloc-like library may be of
great help in a toolbox for performance tuning of general-purpose
applications.



<p><hr>

The author's web site:


<a href="http://www.irisa.fr/caps/">www.irisa.fr/caps/</a>