EDBT 2026 Demo / reviewers in the wild / expert
Aleksey Tyurin
dblp:259/5310
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 |
GPUs and heterogeneous computing · 56% Memory systems · 44% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
partial evaluation |
0.4 | 1 | 2020 | Optimizing GPU programs by partial evaluation · PPoPP 2020 |
GPUs and heterogeneous computing
GPU programming |
0.4 | 1 | 2020 | Optimizing GPU programs by partial evaluation · PPoPP 2020 |
Memory systems
memory optimization |
0.4 | 1 | 2020 | Optimizing GPU programs by partial evaluation · PPoPP 2020 |
GPUs and heterogeneous computing › GPU programming
CUDA |
0.1 | 1 | 2020 | Optimizing GPU programs by partial evaluation · PPoPP 2020 |
Methods — techniques the papers use, named apart from their topics
program transformation · 0.9partial evaluation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Optimizing GPU programs by partial evaluationabstractWhile GPU utilization allows one to speed up computations to the orders of magnitude, memory management remains the bottleneck making it often a challenge to achieve the desired performance. Hence, different memory optimizations are leveraged to make memory being used more effectively. We propose an approach automating memory management utilizing partial evaluation, a program transformation technique that enables data accesses to be pre-computed, optimized, and embedded into the code, saving memory transactions. An empirical evaluation of our approach shows that the transformed program could be up to 8 times as efficient as the original one in the case of CUDA C naïve string pattern matching algorithm implementation. Aleksey Tyurin, Daniil Berezun, Semyon V. Grigorev |
PPoPP | 1 |