Memory-aware Compiler Optimization
Memory-Aware Compiler Optimization is a compiler optimization technique that belongs to the class of program transformation methods, distinguished by its explicit consideration of memory hierarchy characteristics—such as cache locality, bandwidth constraints, and data reuse patterns—to enhance performance through targeted code transformations that minimize memory access latency and maximize data throughput.
30
Publications
1.1K
Citations
100
Authors
47
Institutions
Publications per year
2017–2026
10
30
Armando Solar-Lezama, Gilad Arnold, Liviu Tancau et al. · 2007 · 150 citations
William Pugh · 1999 · 141 citations
Automating the generation of composed linear algebra kernels
Geoffrey Belter, Elizabeth R. Jessup, Ian Karlin et al. · 2009 · 60 citations
Understanding the performance of webassembly applications
Yutian Yan, Tengfei Tu, Lijian Zhao et al. · 2021 · 60 citations
1–5 of 30
100
University of Illinois Urbana-Champaign, United States
2 publications · 111 citations
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 100
47
University of California, Irvine
Irvine, United States
3 h-index
6 publications
96 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
173 citations
Berkeley College
New York, United States
2 h-index
10 publications
865 citations

University of Edinburgh
Edinburgh, United Kingdom
2 h-index
8 publications
164 citations
Lancaster University
Lancaster, United Kingdom
2 h-index
2 publications
41 citations
Syracuse University
Syracuse, United States
2 h-index
4 publications
86 citations
Seoul National University
Seoul, South Korea
2 h-index
3 publications
66 citations
University of California, Berkeley
Berkeley, United States
2 h-index
10 publications
865 citations
1–8 of 47
PACMPL · 2 publications · 43 citations
2
h-index
2 publications · 39 citations
2
h-index
1 publications · 15 citations
1
h-index
Repository · 1 publications · 18 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
1–5