EDBT 2026 Demo / reviewers in the wild / expert
Minor Huffman
dblp:14/4447
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1990
—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 |
Performance modeling and evaluation · 88% Memory systems · 12% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation › queueing analysis
blocking |
0.0 | 1 | 1990 | Blocking: Exploiting Spatial Locality for Trace Compaction · SIGMETRICS 1990 |
Performance modeling and evaluation › simulation › discrete-event simulation
trace-driven simulation |
0.0 | 1 | 1990 | Blocking: Exploiting Spatial Locality for Trace Compaction · SIGMETRICS 1990 |
Performance modeling and evaluation › simulation › architectural simulation
simulation acceleration |
0.0 | 1 | 1990 | Blocking: Exploiting Spatial Locality for Trace Compaction · SIGMETRICS 1990 |
Methods — techniques the papers use, named apart from their topics
cache filtering · 0.0blocking filtering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | Blocking: Exploiting Spatial Locality for Trace CompactionabstractTrace-driven simulation is a popular method of estimating the performance of cache memories, translation lookaside buffers, and paging schemes. Because the cost of trace-driven simulation is directly proportional to trace length, reducing the number of references in the trace significantly impacts simulation time. This paper concentrates on trace driven simulation for cache miss rate analysis. Previous schemes, such as cache filtering, exploited temporal locality for compressing traces and could yield an order of magnitude reduction in trace length. A technique called blocking and a variant called blocking with temporal data are presented that compress traces by exploiting spatial locality. Experimental results show that blocking filtering combined with cache filtering can reduce trace length by nearly two orders of magnitude while introducing about 10% error in cache miss rate estimates. Anant Agarwal, Minor Huffman |
SIGMETRICS | 2 |