EDBT 2026 Demo / reviewers in the wild / expert
Adam R. Talcott
dblp:53/4241
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 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 |
Processor architecture and microarchitecture · 67% Performance modeling and evaluation · 33% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture
branch prediction |
0.0 | 1 | 1994 | The Impact of Unresolved Branches on Branch Prediction Scheme Performance · ISCA 1994 |
Processor architecture and microarchitecture › branch prediction
history-based branch prediction |
0.0 | 1 | 1994 | The Impact of Unresolved Branches on Branch Prediction Scheme Performance · ISCA 1994 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | The influence of branch prediction table interference on branch prediction scheme performance
Adam R. Talcott, Mario Nemirovsky, Roger C. Wood |
PACT | 1 |
| 1994 | The Impact of Unresolved Branches on Branch Prediction Scheme PerformanceabstractExamines the benefits of the early resolution of branch instructions and the impact of unresolved branches on history-based branch prediction schemes by using two new metrics that are more revealing than branch prediction accuracy alone. The authors first briefly review a number of branch prediction schemes and introduce two new branch prediction scheme performance metrics. They then utilize these metrics to gauge the improvement in branch prediction scheme performance when only the outcomes of unresolved branches are predicted. Finally, they examine two approaches for handling multiple unresolved branches in history-based branch prediction schemes, and determine that prediction accuracy remains quite stable when older branch histories are used.> Adam R. Talcott, Wayne Yamamoto, Mauricio J. Serrano, Roger C. Wood, Mario Nemirovsky |
ISCA | 1 |