VLDB 2026 Research / reviewers in the wild / expert
Alexandra Angerd
dblp:211/8219
· DBLP profile ↗
3ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 3 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
2 papers |
Memory systems · 53% GPUs and heterogeneous computing · 13% Emerging computing paradigms · 13% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
memory bandwidth |
0.6 | 1 | 2022 | GBDI: Going Beyond Base-Delta-Immediate Compression with Global Bases · HPCA 2022 |
Memory systems
memory compression |
0.6 | 1 | 2022 | GBDI: Going Beyond Base-Delta-Immediate Compression with Global Bases · HPCA 2022 |
GPUs and heterogeneous computing › GPU microarchitecture
GPU register file |
0.3 | 1 | 2017 | A Framework for Automated and Controlled Floating-Point Accuracy Reduction in Graphics Applications on GPUs · ACM Trans. Archit. Code Optim. 2017 |
Energy-efficient computing
power management |
0.3 | 1 | 2017 | A Framework for Automated and Controlled Floating-Point Accuracy Reduction in Graphics Applications on GPUs · ACM Trans. Archit. Code Optim. 2017 |
Emerging computing paradigms › approximate computing
precision reduction |
0.3 | 1 | 2017 | A Framework for Automated and Controlled Floating-Point Accuracy Reduction in Graphics Applications on GPUs · ACM Trans. Archit. Code Optim. 2017 |
Hardware accelerators and domain-specific architectures › domain-specific accelerator
compression accelerator |
0.2 | 1 | 2022 | GBDI: Going Beyond Base-Delta-Immediate Compression with Global Bases · HPCA 2022 |
Methods — techniques the papers use, named apart from their topics
clustering algorithm · 0.6data-driven precision selection · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | GBDI: Going Beyond Base-Delta-Immediate Compression with Global BasesabstractMemory bandwidth is limiting performance for many emerging applications. While compression techniques can unlock a higher memory bandwidth, prior art offers only modestly better bandwidth. This paper contributes with a new compression method – Global Base Delta Immediate compression (GBDI) – that offers substantially higher memory bandwidth by, unlike prior art, selecting base values across memory blocks. GBDI uses a novel clustering algorithm through data analysis in the background. The presented accelerator infrastructure offers low area overhead and latency. This paper shows that GBDI offers a compression ratio of 2.3×, and yields 1.5× higher bandwidth and 1.1× higher performance compared with a baseline without compression support, on average, for SPEC2017 benchmarks requiring medium to high memory bandwidth. Alexandra Angerd, Angelos Arelakis, Vasilis Spiliopoulos, Erik Sintorn, Per Stenström |
HPCA | 1 |
| 2020 | A GPU Register File using Static Data CompressionabstractGPUs rely on large register files to unlock thread-level parallelism for high throughput. Unfortunately, large register files are power hungry, making it important to seek for new approaches to improve their utilization. Alexandra Angerd, Erik Sintorn, Per Stenström |
ICPP | 1 |
| 2017 | A Framework for Automated and Controlled Floating-Point Accuracy Reduction in Graphics Applications on GPUsabstractReducing the precision of floating-point values can improve performance and/or reduce energy expenditure in computer graphics, among other, applications. However, reducing the precision level of floating-point values in a controlled fashion needs support both at the compiler and at the microarchitecture level. At the compiler level, a method is needed to automate the reduction of precision of each floating-point value. At the microarchitecture level, a lower precision of each floating-point register can allow more floating-point values to be packed into a register file. This, however, calls for new register file organizations. This article proposes an automated precision-selection method and a novel GPU register file organization that can store floating-point register values at arbitrary precisions densely. The automated precision-selection method uses a data-driven approach for setting the precision level of floating-point values, given a quality threshold and a representative set of input data. By allowing a small, but acceptable, degradation in output quality, our method can remove a significant amount of the bits needed to represent floating-point values in the investigated kernels (between 28% and 60%). Our proposed register file organization exploits these lower-precision floating-point values by packing several of them into the same physical register. This reduces the register pressure per thread by up to 48%, and by 27% on average, for a negligible output-quality degradation. This can enable GPUs to keep up to twice as many threads in flight simultaneously. Alexandra Angerd, Erik Sintorn, Per Stenström |
ACM Trans. Archit. Code Optim. | 1 |