Name
Abstract | ||
|---|---|---|
Due to shared cache contentions and interconnect delays, data prefetching is more critical in alleviating penalties from increasing memory latencies and demands on chip-multiprocessors (CMPs). Through deep analysis of SPEC2000 applications, we find that a part of the nearby data memory references often exhibit highly-repeated patterns with long, but equal block reuse distance. These references can form a coterminous group (CG). Coterminous locality is introduced as that when a member in a CG is referenced, the remaining members will likely be referenced in the near future. Based on the coterminous locality behavior, we implement a novel CG data prefetcher on CMPs. Performance evaluations show that the proposed prefetcher can accurately cover up to 40-50% of the total misses, and result in 50-60% of potential performance improvement for several selected workload mixes |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/IPDPS.2006.1639326 | IPDPS |
Keywords | DocType | ISBN |
data prefetching,microprocessor chips,coterminous locality,memory latency,storage management,spec2000,coterminous group data,proposed prefetcher,novel cg data prefetcher,performance evaluation,memory latencies,chip multiprocessors,coterminous group,nearby data memory reference,potential performance improvement,coterminous locality behavior,grouped data,information science,computer architecture,bandwidth,data engineering,history,memory management,pattern analysis | Conference | 1-4244-0054-6 |
Citations | PageRank | References |
6 | 0.51 | 20 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xudong Shi | 1 | 53 | 10.22 |
| Zhen Yang | 2 | 38 | 2.86 |
| Jih-Kwon Peir | 3 | 248 | 34.53 |
| Lu Peng | 4 | 84 | 10.79 |
| Yen-Kuang Chen | 5 | 888 | 95.79 |
| Victor W. Lee | 6 | 965 | 53.75 |
| Bob Liang | 7 | 6 | 0.51 |