Analysing and improving clustering based sampling for microprocessor simulation

  • Authors:
  • Yue Luo;Ajay Joshi;Aashish Phansalkar;Lizy John;Joydeep Ghosh

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Texas at Austin, USA.;Department of Electrical and Computer Engineering, University of Texas at Austin, USA.;Department of Electrical and Computer Engineering, University of Texas at Austin, USA.;Department of Electrical and Computer Engineering, University of Texas at Austin, USA.;Department of Electrical and Computer Engineering, University of Texas at Austin, USA

  • Venue:
  • International Journal of High Performance Computing and Networking
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a set of statistical metrics for making a comprehensive, fair, and insightful evaluation of features, clustering algorithms, and distance measures in representative sampling techniques for microprocessor simulation. Our evaluation of different clustering algorithms using these metrics shows that CLARANS clustering algorithm produces better quality clusters in the feature space and more homogeneous phases for CPI compared to the popular k-means algorithm. We also propose a new micro-architecture independent data locality based feature, Reuse Distance Distribution (RDD), for finding phases in programs, and show that the RDD feature consistently results in more homogeneous phases than the Basic Block Vector (BBV) feature for many SPEC CPU2000 benchmark programs.