Name
Abstract | ||
|---|---|---|
Data cache prefetching in the L2 is at the forefront of pre-fetching research. In this paper we analyze the impact of virtual page boundaries on these prefetchers. Conservative measurements on real hardware show that 30-50% of consecutive virtual pages are mapped to pages which are not consecutive in physical memory. Advanced hardware prefetching techniques that detect access patterns which span virtual page boundaries often end up prefetching data that is from the wrong physical page. Meanwhile, current simulation techniques for evaluating prefetching algorithms assume that all virtual pages are mapped consecutively. We show that not accounting for virtual page boundaries in simulation can lead to overestimates of as much as 29% (9% on average). We also show that a simple prefetch filter can improve performance up to 32% (7% on average) and recover the overestimated performance. This leads to the conclusion that although previous simulations may not have accounted for virtual page boundaries, the results they demonstrate are still attainable and that it is not necessary to simulate virtual page boundaries to get accurate results. However, actual hardware designers should take care to implement a simple filter or else their hardware may not show the same gains in performance as they did in simulation. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1242531.1242537 | Conf. Computing Frontiers |
Keywords | DocType | Citations |
wrong physical page,virtual page,prefetching data,actual hardware designer,consecutive virtual page,current simulation technique,advanced hardware,virtual page boundary,real hardware show,prefetching algorithm,virtual memory | Conference | 4 |
PageRank | References | Authors |
0.46 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ronald G. Dreslinski | 1 | 1258 | 81.02 |
| Ali Saidi | 2 | 1552 | 62.07 |
| Trevor Mudge | 3 | 6139 | 659.74 |
| Steven K. Reinhardt | 4 | 3885 | 226.69 |