We describe an important memory optimization that arises in the presence of aggregate data structures such as arrays and structs in a C/C++ based system design methodology. We present an algorithm for determining an optimized memory layout of such data. Our implementation consists of a pointer analysis and resolution phase, followed by memory layout optimization. Experiments on typical applications from the DSP domain result in up to 44% improvement in memory performance.
展开▼
机译：我们描述了一个重要的内存优化，在存在的聚合数据结构存在时出现在C / C ++基于系统设计方法中的阵列和结构等。我们介绍了一种用于确定这些数据的优化存储器布局的算法。我们的实现包括指针分析和分辨率阶段，然后是内存布局优化。从DSP域的典型应用程序的实验结果在内存性能上提高了高达44％的提高。
展开▼
