Data-Layout Optimization Using Reuse Distance Distribution

As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture systems use cache to solve this problem, whose utility heavily depends on program data locality. This paper introduces a platform independent data-layout optimization framework to improve program data locality. This framework uses a variable relation model based on variables' reuse distance distribution to quantitate the relation of variables and accordingly assigns variables which are often accessed together in one group. At the same time this framework introduces a dynamic array regrouping method to group dynamic arrays assigned in a group. Experiments show that this data-layout optimization framework can effectively improve program data locality and program performance.

• Type: Conference
• Year: 2006
• Where: EUC
• Authors: Xiong Fu, Yu Zhang, Yiyun Chen
• Keywords: Applied Computing, Data-layout Optimization Framework, Dynamic Arrays, EUC 2006, Program Data Locality