Demo Data from VLDB 2026 / reviewers in the wild / expert
Sergej Breiter
dblp:345/8003
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2026
0009-0007-7742-1427ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-author · 2 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 |
Memory systems · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › processing-in-memory
DRAM-PIM |
0.9 | 1 | 2025 | Reproducibility Report for SC25 Paper DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs · SC 2025 |
Memory systems
processing-in-memory |
0.9 | 1 | 2025 | Reproducibility Report for SC25 Paper DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs · SC 2025 |
Information retrieval › similarity search › nearest neighbor search
approximate nearest neighbor search |
0.3 | 1 | 2025 | Reproducibility Report for SC25 Paper DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs · SC 2025 |
Information retrieval › similarity search
nearest neighbor search |
0.3 | 1 | 2025 | Reproducibility Report for SC25 Paper DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs · SC 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Cache partitioning for sparse matrix-vector multiplication on the A64FXabstractOne of the novel features of the Fujitsu A64FX CPU is the sector cache . This feature enables hardware-supported partitioning of the L1 and L2 caches and allows the programmer control of which partition is used to place data in. This paper performs an in-depth study of applying the sector cache to sparse matrix-vector multiplication (SpMV) in the Compressed Sparse Row (CSR) format using a collection of 490 sparse matrices. A performance model based on reuse analysis is used to better understand situations in which and how the sector cache leads to improved cache reuse and to predict cache behavior. The model predicts the number of L2 cache misses within an error of 2% without cache partitioning. With sector cache enabled, depending on the configuration, the model predicts the number of L2 cache missed within 2–3% and 4–18% for sequential and parallel SpMV with 48 threads, respectively. Further experiments show the effect of various sector cache configurations on performance. A median speedup of about 1.05 × is achieved, whereas the maximum speedup is about 1.6 × . Sergej Breiter, James D. Trotter, Karl Fürlinger |
Parallel Comput. | 1 |
| 2025 | Reproducibility Report for SC25 Paper DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMsabstractThis reproducibility report provides details about the artifact evaluation done with regards to the Artifact Description and Evaluation appendix of SC25 paper DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs by Yu et al. The work was done as part of the Reproducibility Initiative of SC25. The author is a member of the SC25 Reproducibilty Committee. Sergej Breiter |
SC | 1 |
| 2022 | A Profiling-Based Approach to Cache Partitioning of Program Data
Sergej Breiter, Josef Weidendorfer, Minh Thanh Chung, Karl Fürlinger |
PDCAT | 1 |