Demo Data from VLDB 2026 / reviewers in the wild / expert
Cem Fide
dblp:05/6501
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
cache |
0.0 | 1 | 2001 | Dead-block prediction & dead-block correlating prefetchers · ISCA 2001 |
Memory systems › cache › prefetching
data prefetching |
0.0 | 1 | 2001 | Dead-block prediction & dead-block correlating prefetchers · ISCA 2001 |
Memory systems › cache management
dead block prediction |
0.0 | 1 | 2001 | Dead-block prediction & dead-block correlating prefetchers · ISCA 2001 |
Methods — techniques the papers use, named apart from their topics
trace-based prediction · 0.0address correlation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Dead-block prediction & dead-block correlating prefetchersabstractEffective 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. An-Chow Lai, Cem Fide, Babak Falsafi |
ISCA | 2 |