Demo Data from EDBT 2026 / reviewers in the wild / expert
Jory Tsai
dblp:13/3941
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author
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 · 87% Performance modeling and evaluation · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › cache
cache behavior |
0.0 | 1 | 1993 | Analyzing Multiprocessor Cache Behavior Through Data Reference Modeling · SIGMETRICS 1993 |
Memory systems › cache › cache miss
cache miss rate estimation |
0.0 | 1 | 1993 | Analyzing Multiprocessor Cache Behavior Through Data Reference Modeling · SIGMETRICS 1993 |
Performance modeling and evaluation › cache performance modeling
analytical cache modeling |
0.0 | 1 | 1993 | Analyzing Multiprocessor Cache Behavior Through Data Reference Modeling · SIGMETRICS 1993 |
Methods — techniques the papers use, named apart from their topics
data reference modeling · 0.0analytical modeling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Analyzing Multiprocessor Cache Behavior Through Data Reference ModelingabstractThis paper develops a data reference modeling technique to estimate with high accuracy the cache miss ratio in cache-coherent multiproeessors. The technique involves analyzing the dynamic data referencing behavior of parallel algorithms. Data referenee modeling first identifies different types of shared data blocks accessed during the execution of a parallel algorithm, then captures in a few parameters the cache behavior of each shared block as a function of the problem size, number of processors, and cache line size, and finally constructs an analytical expression for each algorithm to estimate the cache miss ratio. Because the number of processors, problem size, and cache line size are included as parameters, the expression for the each miss ratio can be used to predict the performance of systems with different configurations. Six parallel algorithms are studied, and the analytical results compared against previously published simulation results, to establish the confidence level of the data reference modeling technique. It is found that the average prediction error for four out of six algorithms is within five percent and within ten percent for the other two. The paper also derives from the model several results on how cache miss rates scale with system size. Jory Tsai, Anant Agarwal |
SIGMETRICS | 1 |