1 / 8

An Efficient Profile-Analysis Framework for Data-Layout Optimizations

An Efficient Profile-Analysis Framework for Data-Layout Optimizations. By Shai Rubin, Rastislav Bodik, Trishul Chilimbi. Data-Layout Optimization. To improve memory hierarchy performance by exploiting spatial locality Group the data that is accessed together Minimizing cache conflicts

tillie
Download Presentation

An Efficient Profile-Analysis Framework for Data-Layout Optimizations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. An Efficient Profile-Analysis Framework for Data-Layout Optimizations By Shai Rubin, Rastislav Bodik, Trishul Chilimbi

  2. Data-Layout Optimization • To improve memory hierarchy performance by exploiting spatial locality • Group the data that is accessed together • Minimizing cache conflicts • Optimizations • Field rearrangement in an object • Object rearrangement in the heap • Object inlining

  3. Motivation • A solution to find the optimal layout is NP-hard and also poorly approximable • All these techniques are actually heuristics and no guarantee of effectiveness and robustness • A naïve approach is tedious

  4. Solution • A generalized framework to determine the best layout for a given program • Unifying existing profile-based data layout optimizations • A very efficient way of evaluating a candidate layout with simulation

  5. Optimization Evaluation • Memoization • Dynamic programming • Whole Program Misses • The representation omits references that can never suffer any memory fault • Ex. abba • On demand Cache simulation

  6. Results

  7. Discussion • How many applications really use this kind of optimizations? • Some of the optimizations are already automated (ex. Object inlining)

More Related