Dead-block prediction & dead-block correlating prefetchers 论文

2001引用 310
Parallel Computing and Optimization TechniquesAdvanced Data Storage TechnologiesDistributed systems and fault tolerance

详细信息

发表日期
2001-01-01
发表年份
2001

关键词

Parallel Computing and Optimization TechniquesAdvanced Data Storage TechnologiesDistributed systems and fault tolerance

摘要

Effective data prefetching requires accurate mechanisms to predict both “which” cache blocks to prefetch and “when” to prefetch them. This paper proposes the Dead-Block Predictors (DBPs), trace-based predictors that accurately identify “when” an Ll data cache block becomes evictable or “dead”. Predicting a dead block significantly enhances prefetching lookahead and opportunity, and enables placing data directly into Ll, obviating the need for auxiliary prefetch buffers. This paper also proposes Dead-Block Correlating Prefetchers (DBCPs), that use address correlation to predict “which” subsequent block to prefetch when a block becomes evictable. A DBCP enables effective data prefetching in a wide spectrum of pointer-intensive, integer, and floating-point applications.