loading...
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
Rio de Janeiro, Brazil October 24-October 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CAHPC.2005.1117th International Symposium on Compu ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yue Luo, University of Texas at Austin
Ajay Joshi, University of Texas at Austin
Aashish Phansalkar, University of Texas at Austin
Lizy John, University of Texas at Austin
Joydeep Ghosh, University of Texas at Austin
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 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 microarchitecture 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 Basic Block Vector (BBV) for many SPEC CPU2000 benchmark programs.
Citation:
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy John, Joydeep Ghosh, "Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation," sbac-pad, pp.193-200, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions