Title :
Comparing multinomial and k-means clustering for SimPoint
Author :
Hamerly, Greg ; Perelman, Erez ; Calder, Brad
Author_Institution :
Dept. of Comput. Sci., Baylor Univ., Waco, TX, USA
Abstract :
SimPoint is a technique used to pick what parts of the program´s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms from machine learning to automatically find repetitive (similar) patterns in a program´s execution, and it chooses one sample to represent each unique repetitive behavior. Together these samples represent an accurate picture of the complete execution of the program. SimPoint is based on the k-means clustering algorithm; recent work proposed using a different clustering method based on multinomial models, but only provided a preliminary comparison and analysis. In this work we provide a detailed comparison of using k-means and multinomial clustering for SimPoint. We show that k-means performs better than the recently proposed multinomial clustering approach. We then propose two improvements to the prior multinomial clustering approach in the areas of feature reduction and the picking of simulation points which allow multinomial clustering to perform as well as k-means. We then conclude by examining how to potentially combine multinomial clustering with k-means.
Keywords :
data flow analysis; learning (artificial intelligence); pattern clustering; SimPoint; automatic repetitive pattern finding; data clustering; k-means clustering; machine learning; multinomial clustering; program execution simulation; Algorithm design and analysis; Clustering algorithms; Clustering methods; Computational modeling; Computer science; Computer simulation; Error analysis; Intelligent structures; Machine learning; Machine learning algorithms;
Conference_Titel :
Performance Analysis of Systems and Software, 2006 IEEE International Symposium on
Print_ISBN :
1-4244-0186-0
DOI :
10.1109/ISPASS.2006.1620798