Name
Abstract | ||
|---|---|---|
Cache Miss Equations (CME) [GMM97] is a method that accurately describes the cache behavior by means of polyhedra. Even though the computation cost of generating CME is a linear function of the number of references, to solve them is a very time consuming task and thus trying to study a whole program may be infeasible.In this work, we present effective techniques that exploit some properties of the particular polyhedra generated by CME. Such technique reduce the complexity of the algorithm to solve CME, which results in a significant speed-up when compared with traditional methods. In particular, the proposed approach does not require the computation of the vertices of each polyhedron, which has an exponential complexity. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1145/346023.346042 | SIGARCH Computer Architecture News |
Keywords | Field | DocType |
cache behavior,linear function,exponential complexity,effective technique,significant speed-up,equations polyhedron,particular polyhedron,computation cost,cache miss equations,time consuming task | Vertex (geometry),Computer science,Cache,Polyhedron,Parallel computing,Exploit,Cache algorithms,Real-time computing,Cache miss,Linear function,Computation | Journal |
Volume | Issue | Citations |
28 | 1 | 3 |
PageRank | References | Authors |
0.53 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nerina Bermudo | 1 | 51 | 4.23 |
| Xavier Vera | 2 | 59 | 4.50 |
| Antonio González | 3 | 3178 | 229.66 |
| Josep Llosa | 4 | 574 | 39.30 |