A systematic approach to model-guided empirical search for memory hierarchy optimization

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

Abstract

The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy. Our approach combines compiler models and heuristics with guided empirical search to take advantage of their complementary strengths. The models and heuristics limit the search to a small number of candidate implementations, and the empirical results provide accurate feedback information to the compiler. In previous work, we propose a compiler algorithm for deriving a set of parameterized solutions, followed by a model-guided empirical search to determine the best integer parameter values and select the best overall solution. This paper focuses on formalizing the process of deriving parameter values, which is a multi-variable optimization problem, and considers the role of AI search techniques in deriving a systematic framework for the search. © 2006 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chen, C., Chame, J., Hall, M., & Lerman, K. (2006). A systematic approach to model-guided empirical search for memory hierarchy optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4339 LNCS, pp. 433–440). https://doi.org/10.1007/978-3-540-69330-7_30

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