Optimizing program performance via similarity, using a feature-agnostic approach

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

Abstract

This work proposes a new technique for performance evaluation to predict performance of parallel programs across diverse and complex systems. In this work the term system is comprehensive of the hardware organization, the development and execution environment. The proposed technique considers the collection of completion times for some pairs (program, system) and constructs an empirical model that learns to predict performance of unknown pairs (program, system). This approach is feature-agnostic because it does not involve previous knowledge of program and/or system characteristics (features) to predict performance. Experimental results conducted with a large number of serial and parallel benchmark suites, including SPEC CPU2006, SPEC OMP2012, and systems show that the proposed technique is equally applicable to be employed in several compelling performance evaluation studies, including characterization, comparison and tuning of hardware configurations, compilers, run-time environments or any combination thereof. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Cammarota, R., Beni, L. A., Nicolau, A., & Veidenbaum, A. V. (2013). Optimizing program performance via similarity, using a feature-agnostic approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8299 LNCS, pp. 199–213). https://doi.org/10.1007/978-3-642-45293-2_15

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