Demo Data from VLDB 2026 / reviewers in the wild / expert
Andreas Simburger
dblp:139/7063
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software 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.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
dynamic optimization |
0.2 | 1 | 2013 | The potential of polyhedral optimization: An empirical study · ASE 2013 |
Compilers and program optimization › loop transformation
polyhedral compilation |
0.2 | 1 | 2013 | The potential of polyhedral optimization: An empirical study · ASE 2013 |
Methods — techniques the papers use, named apart from their topics
polyhedral analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | The potential of polyhedral optimization: An empirical studyabstractPresent-day automatic optimization relies on powerful static (i.e., compile-time) analysis and transformation methods. One popular platform for automatic optimization is the polyhedron model. Yet, after several decades of development, there remains a lack of empirical evidence of the model's benefits for real-world software systems. We report on an empirical study in which we analyzed a set of popular software systems, distributed across various application domains. We found that polyhedral analysis at compile time often lacks the information necessary to exploit the potential for optimization of a program's execution. However, when conducted also at run time, polyhedral analysis shows greater relevance for real-world applications. On average, the share of the execution time amenable to polyhedral optimization is increased by a factor of nearly 3. Based on our experimental results, we discuss the merits and potential of polyhedral optimization at compile time and run time. Andreas Simburger, Sven Apel, Armin Größlinger, Christian Lengauer |
ASE | 1 |