KIT | KIT-Bibliothek | Impressum | Datenschutz

Selecting Computer Architectures by Means of Control-Flow-Graph Mining

Eichinger, Frank; Böhm, Klemens

Abstract:

Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approaches require expensive simulations or program executions, we propose an approach which solely relies on program analysis. We correlate substructures of the control-flow graphs representing the individual functions with the runtime on certain systems. This leads to a prediction framework based on graph mining, classification and classifier fusion. In our evaluation with the SPEC CPU 2000 and 2006 benchmarks, we predict the faster system out of two with high accuracy and achieve significant speedups in execution time.


Volltext §
DOI: 10.5445/IR/1000012600
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2009
Sprache Englisch
Identifikator ISBN: 978-3-642-03914-0
ISSN: 0302-9743
urn:nbn:de:swb:90-126005
KITopen-ID: 1000012600
Erschienen in Advances in Intelligent Data Analysis VIII. 8th International Symposium on Intelligent Data Analysis, IDA 2009, Lyon, France, August 31 - September 2, 2009. Ed.: N.M. Adams
Verlag Springer Verlag
Seiten 309-320
Serie Lecture Notes in Computer Science ; 5772
Bemerkung zur Veröffentlichung © Springer-Verlag Berlin Heidelberg 2009

http://www.springerlink.com/content/978-3-642-03914-0

http://www.ipd.uka.de/~eichi/papers/eichinger09selecting.pdf
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page