1. 1 Instruction Based Memory Distance Analysis and its Application to Optimization Changpeng Fang Steve Carr Soner Önder Zhenlin Wang

2. 2 Motivation  Widening gap between processor and memory speed  memory wall  Static compiler analysis has limited capability  regular array references only  index arrays  integer code  Reuse distance prediction across program inputs  number of distinct memory locations accessed between two references to the same memory location  applicable to more than just regular scientific code  locality as a function of data size  predictable on whole program and per instruction basis for scientific codes

3. 3 Motivation  Memory distance  A dynamic quantifiable distance in terms of memory reference between tow access to the same memory location.  reuse distance  access distance  value distance  Is memory distance predictable across both integer and floating-point codes?  predict miss rates  predict critical instructions  identify instructions for load speculation

4. 4 Related Work  Reuse distance  Mattson, et al. ’70  Sugamar and Abraham ’94  Beyls and D’Hollander ’02  Ding and Zhong ’03  Zhong, Dropsho and Ding ’03  Shen, Zhong and Ding ’04  Fang, Carr, Önder and Wang ‘04  Marin and Mellor-Crummey ’04  Load speculation  Moshovos and Sohi ’98  Chyrsos and Emer ’98  Önder and Gupta ‘02

5. 5 Background  Memory distance  can use any granularity (cache line, address, etc.)  either forward or backward  represented as a pattern  Represent memory distance as a pattern  divide consecutive ranges into intervals  we use powers of 2 up to 1K and then 1K intervals  Data size  the largest reuse distance for an input set  characterize reuse distance as a function of the data size  Given two sets of patterns for two runs, can we predict a third set of patterns given its data size?

6. 6 Background  Let be the distance of the i th bin in the first pattern and be that of the second pattern. Given the data sizes s 1 and s 2 we can fit the memory distances using  Given c i, e i, and f i, we can predict the memory distance of another input set with its data size

7. 7 Instruction Based Memory Distance Analysis  How can we represent the memory distance of an instruction?  For each active interval, we record 4 words of data min, max, mean, frequency  Some locality patterns cross interval boundaries merge adjacent intervals, i and i + 1, if merging process stops when a minimum frequency is found needed to make reuse distance predictable  The set of merged intervals make up memory distance patterns

8. 8 Merging Example

9. 9 What do we do with patterns?  Verify that we can predict patterns given two training runs  coverage  accuracy  Predict miss rates for instructions  Predict loads that may be speculated

10. 10 Prediction Coverage  Prediction coverage indicates the percentage of instructions whose memory distance can be predicted  appears in both training runs  access pattern appears in both runs and memory distance does not decrease with increase in data size (spatial locality) same number of intervals in both runs  Called a regular pattern  For each instruction, we predict its i th pattern by  curve fitting the i th pattern of both training runs  applying the fitting function to construct a new min, max and mean for the third run  Simple, fast prediction

11. 11 Prediction Accuracy  An instruction’s memory distance is correctly predicted if all of its patterns are predicted correctly  predicted and observed patterns fall in same interval  or, given two patterns A and B such that B.min  A.max  B.max

12. 12 Experimental Methodology  Use 11 CFP2000 and 11 CINT2000 benchmarks  others don’t compile correctly  Use ATOM to collect reuse distance statistics  Use test and train data sets for training runs  Evaluation based on dynamic weighting  Report reuse distance prediction accuracy  value and access very similar

13. 13 Reuse Distance Prediction SuitePatternsCoverage % Accuracy % %constant%linear CFP200085.17.793.097.6 CINT200081.25.191.693.8

14. 14 Coverage issues  Reasons for no coverage 1. instruction does not appear in at least one test run 2. reuse distance of test is larger than train 3. number of patterns does not remain constant in both training runs SuiteReason 1Reason 2Reason 3 CFP20004.2%0.3%2.5% CINT20002.2%4.4%1.8%

15. 15 Prediction Details  Other patterns  183.equake has 13.6% square root patterns  200.sixtrack, 186.crafty all constant (no data size change)  Low coverage  189.lucas – 31% of static memory operations do not appear in training runs  164.gzip – the test reuse distance greater than train reuse distance cache-line alignment

16. 16 Number of Patterns Suite1234 55 CFP200081.8%10.5%4.8%1.4%1.5% CINT200072.3%10.9%7.6%4.6%5.3%

17. 17 Miss Rate Prediction  Predict a miss for a reference if the backward reuse distance is greater than the cache size.  neglects conflict misses  Accurate miss rate prediction

18. 18 Miss Rate Prediction Methodology  Three miss-rate prediction schemes  TCS – test cache simulation Use the actual miss rates from running the program on a the test data for the reference data miss rates  RRD – reference reuse distance Use the actual reuse distance of the reference data set to predict the miss rate for the reference data set An upper bound on using reuse distance  PRD –predicted reuse distance Use the predicted reuse distance for the reference data set to predict the miss rate.

19. 19 Cache Configurations config no.L1L2 132K, fully assoc.1Mfully assoc. 234234 32K, 2-way1M 8-way 4-way 2-way

20. 20 L1 Miss Rate Prediction Accuracy SuitePRDRRDTCS CFP200097.598.495.1 CINT200094.496.793.9

21. 21 L2 Miss Rate Accuracy Suite2-wayFully Associative PRDRRDTCSPRDRRDTCS CFP200091%93%87%97%99.9%91% CINT200091%95%87%94%99.9%89%

22. 22 Critical Instructions  Given reuse distance for an instruction  Can we determine which instructions are critical in terms of cache performance?  An instruction is critical if it is in the set of instructions that generate the most L2 cache misses  Those top miss-rate instructions whose cumulative total misses account for 95% of the misses in a program.  Use the execution frequency of one training run to determine the relative contribution number of misses for each instruction  Compare the actual critical instructions with predicted  Use cache configuration 2

23. 23 Critical Instruction Prediction SuitePRDRRDTCS%pred%act CPF200092%98%51%1.66%1.67% CINT200089%98%53%0.94%0.97%

24. 24 Critical Instruction Patterns Suite1234 55 CFP200022.138.420.012.86.7 CINT200018.714.525.522.518

25. 25 Miss Rate Discussion  PRD performs better than TCS when data size is a factor  TCS performs better when data size doesn’t change much and there are conflict misses  PRD is much better at identifying the critical instructions than TCS  these instructions should be targets of optimization

26. 26 Memory Disambiguation  Load speculation  Can a load safely be issued prior to a preceding store?  Use a memory distance to predict the likelihood that a store to the same address has not finished  Access distance  The number of memory operations between a store to and load from the same address  Correlated to instruction distance and window size  Use only two runs If access distance not constant, use the access distance of larger of two data sets as a lower bound on access distance

27. 27 When to Speculate  Definitely “no”  access distance less than threshold  Definitely “yes”  access distance greater than threshold  Threshold lies between intervals  compute predicted mis-speculation frequency (PMSF) speculate is PMSF < 5%  When threshold does not intersect intervals total of frequencies that lie below the threshold  Otherwise

28. 28 Value-based Prediction  Memory dependence only if addresses and values match store a 1, v 1 store a 2, v 2 store a 3, v 3 load a 4, v 4 Can move ahead if a 1 =a 2 =a 3 =a 4, v 2 =v 3 and v 1 ≠v 2  The access distance of a load to the first store in a sequence of stores storing the same value is called the value distance

29. 29 Experimental Design  SPEC CPU2000 programs  SPEC CFP2000 171.swim, 172.mgrid, 173.applu, 177.mesa, 179.art, 183.equake, 188.ammp, 301.apsi  SPEC CINT2000 164.gzip, 175.vpr, 176.gcc, 181.mcf, 186.crafty, 197.parser, 253.perlbmk, 300.twolf  Compile with gcc 2.7.2 –O3  Comparison  Access distance, value distance  Store set with 16KB table, also with values  Perfect disambiguation

30. 30 Micro-architecture issue width8 fetch width8 retire width16 window size128 load/store queue 128 functional units8 fetch multiblock gshare data cacheperfect memory ports2 OperationLatency load2 int division8 int multiply4 other int1 float multiply4 float addition3 float division8 other float2

31. 31 IPC and Mis-speculation Suite Access Distance Store Set 16KB Table Perfect CFP20003.213.373.71 CINT20002.903.223.35 Suite Mis-speculation Rate% Speculated Loads AccessStore SetAccessStore Set CFP20002.360.0757.262.0 CINT20002.330.0826.934.7

32. 32 Value-based Disambiguation Suite Value Distance Store Set 16KB Value CFP20003.343.55 CINT20003.003.23 Suite Mis-speculation Rate % Speculated Loads CFP20001.2259.3 CINT20001.5527.6

33. 33 Cache Model SuiteAccessStore Set 16K CFP20001.551.61 CINT20001.531.60 SuiteValueStore Set 16K CFP20001.591.63 CINT20001.551.65

34. 34 Summary  Over 90% of memory operations can have reuse distance predicted with a 97% and 93% accuracy, for floating-point and integer programs, respectively  We can accurately predict miss rates for floating- point and integer codes  We can identify 92% of the instructions that cause 95% of the L2 misses  Access- and value-distance-based memory disambiguation are competitive with best hardware techniques without a hardware table

35. 35 Future Work  Develop a prefetching mechanism that uses the identified critical loads.  Develop an MLP system that uses critical loads and access distance.  Path-sensitive memory distance analysis  Apply memory distance to working-set based cache optimizations  Apply access distance to EPIC style architectures for memory disambiguation.