New South Wales

Publications (3)0 Total impact

• Article: Let's Study Whole-Program Cache Behaviour Analytically

  Xavier Vera, Jingling Xue, New South Wales
  [show abstract] [hide abstract]
  ABSTRACT: Based on a new characterisation of data reuse across multiple loop nests, we present a method, an implementation and experimental results for analysing the cache behaviour of whole programs with regular computations. Validation against cache simulation using real codes confirms the efficiency and accuracy of our method. The largest program we have analysed, Applu from SPECfp95, has 3868 lines, 16 subroutines and 2565 references. Assuming a 32KB cache with a 32B line size, our method obtains the miss ratio with an absolute error of about 0.8 in about 128 secs while the simulator used runs for nearly 5 hours on a 933MHz Pentlure III PC. Our method can be used to guide compiler locality optimisations and improve cache simulation performance.
  05/2003;
• Article: Let's Study Whole-Program Cache Behaviour Analytically

  Xavier Vera, New South Wales
  [show abstract] [hide abstract]
  ABSTRACT: Based on a new characterisation of data reuse across multiple loop nests, we present a method, an implementation and experimental results for analysing the cache behaviour of whole programs with regular computations. Validation against cache simulation using real codes con rms the eciency and accuracy of our method. The largest program we have analysed, Applu from SPECfp95, has 3868 lines, 16 subroutines and 2565 references. Assuming a 32KB cache with a 32B line size, our method obtains the miss ratio with an absolute error of about 0.8% in about 128 secs while the simulator used runs for nearly 5 hours on a 933MHz Pentium III PC. Our method can be used to guide compiler locality optimisations and improve cache simulation performance. 2 1
  01/2002;
• Article: Analysing Cache Memory Behaviour for Programs with IF Statements

  Xavier Vera, New South Wales
  [show abstract] [hide abstract]
  ABSTRACT: Cache memories are widely used to bridge the increasing performance gap between processors and main memories. However, cache memories are eective only when the program exhibits good cache locality. Analytical methods such as the Cache Miss Equations (CMEs) use mathematical formulas to provide a precise characterisation of the number and causes of cache misses in loop-oriented programs. The information gathered can be used to guide locality enhancement compiler optimisations. Unfortunately, all existing analytical methods are limited to special forms of perfectly nested loops, which, for example, must be free of IF statements. This paper presents an analytical method for analysing the cache behaviour of perfectly nested loops containing IF statements with compile-time-analysable conditionals. We demonstrate that our method, together with the compiler technique loop sinking, can be used to analyse a large number of imperfect loop nests. By analysing the loop nests in SPECfp95, Perfect Suite, Livermore kernels, Linpack and Lapack, we nd that our method enables 17% more loop nests to be analysed than previously. This represents an important step towards analysing complex program constructs in real programs. 2 1
  09/2001;