EDBT 2026 Demo / reviewers in the wild / expert
Yunzhe Liu 0005
dblp:383/4135
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
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 · 54% Memory systems · 46% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture
branch prediction |
0.8 | 1 | 2024 | AVM-BTB: Adaptive and Virtualized Multi-level Branch Target Buffer · ISCA 2024 |
Processor architecture and microarchitecture › branch prediction
branch target buffer |
0.8 | 1 | 2024 | AVM-BTB: Adaptive and Virtualized Multi-level Branch Target Buffer · ISCA 2024 |
Memory systems › memory hierarchy
cache hierarchy |
0.8 | 1 | 2024 | AVM-BTB: Adaptive and Virtualized Multi-level Branch Target Buffer · ISCA 2024 |
Memory systems › cache › CPU cache
instruction cache |
0.8 | 1 | 2024 | AVM-BTB: Adaptive and Virtualized Multi-level Branch Target Buffer · ISCA 2024 |
Processor architecture and microarchitecture › instruction fetch
instruction prefetching |
0.2 | 1 | 2024 | AVM-BTB: Adaptive and Virtualized Multi-level Branch Target Buffer · ISCA 2024 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.8entropy analysis · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | AVM-BTB: Adaptive and Virtualized Multi-level Branch Target BufferabstractBranch Target Buffer (BTB) plays an important role in modern processors. It is used to identify branches in the instruction stream and predict branch targets. The accuracy of BTB is highly impacted by BTB capacity. However, expanding BTB capacity using traditional methods requires valuable on-chip SRAM. Both timing and area restriction make these approaches unsustainable. Moreover, these methods overlook the different demands of various applications, leading to increased power consumption and resource waste in some cases. To address this problem, we propose AVM-BTB. The key observations behind AVM-BTB come from three aspects: 1) BTB requirements vary over different applications and even over different running stages of the same application. 2) Micro-operation Cache (Uop Cache) and ICache exhibit inefficiency when confronted with instruction footprints that greatly exceed their capacity. 3) In specific scenarios of frontend overload, reducing cache capacity and increasing BTB size can effectively mitigate expensive branch prediction errors. Simultaneously, the implementation of Fetch Directed Instruction Prefetching (FDIP) can offset the limitations in cache capacity to some extent. These observations reveal the feasibility of dynamically borrowing cache capacity as temporary BTB and returning these BTB to cache when they are not needed, further resulting in an adaptive and virtualized multi-level BTB scheme. However, such a BTB structure is non-trivial. In this work, from the perspective of instructions, the cache hierarchy stores instruction data, while the BTB stores metadata used for branch prediction and instruction prefetch. Targeting high performance, AVM-BTB maintains a dynamic balance between data and metadata by monitoring the BTB error rate and effective accesses. Evaluation with 1253 traces shows that AVM-BTB is suitable for both frontend-bound and frontend-friendly scenarios, without consuming additional SRAM and with reasonable implementation efforts. Compared to baseline, AVM-BTB delivers an average performance boost of $18.22\%$ and a power consumption reduction of $2.77\%$. It also outperforms the five state-of-the-art solutions by $6.26 \%-18.26 \%$ on average in terms of IPC. Yunzhe Liu 0005, Xinyu Li 0010, Qi Guo 0001, Fuxin Zhang |
ISCA | 1 |