Name
Abstract | ||
|---|---|---|
Recent research results show that conventional hardware-only cache solutions result in unsatisfactory cache utilization for both regular and irregular applications. To overcome this problem, a number of architectures introduce instruction hints to assist cache replacement. For example, Intel Itanium architecture augments memory accessing instructions with cache hints to distinguish data that will be referenced in the near future from the rest. With the availability of such methods, the performance of the underlying cache architecture critically depends on the ability of the compiler to generate code with appropriate cache hints. In this paper we formulate this problem - giving cache hints to memory instructions such that cache miss rate is minimized - as a 0/1 knapsack problem, which can be efficiently solved using a dynamic programming algorithm. The proposed approach has been implemented in our compiler testbed and evaluated on a set of scientific computing benchmarks. Initial results show that our approach is effective on reducing the cache miss rate and improving program performance. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-24644-2_6 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
scientific computing,dynamic programming algorithm,knapsack problem | Conference | 2958 |
ISSN | Citations | PageRank |
0302-9743 | 9 | 0.59 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongbo Yang | 1 | 55 | 3.49 |
| Ramaswamy Govindarajan | 2 | 170 | 21.33 |
| Guang R. Gao | 3 | 2661 | 265.87 |
| Ziang Hu | 4 | 217 | 14.98 |