Selecting computer architectures by means of control-flow-graph mining

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Eichinger, F., & Böhm, K. (2009). Selecting computer architectures by means of control-flow-graph mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5772 LCNS, pp. 309–320). https://doi.org/10.1007/978-3-642-03915-7_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free