Demo Data from VLDB 2026 / reviewers in the wild / expert
Dave Rostron
dblp:03/4061
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
loop transformation |
0.1 | 1 | 2007 | Multi-level tiling: M for the price of one · SC 2007 |
Compilers and program optimization › loop transformation
multi-level tiling |
0.1 | 1 | 2007 | Multi-level tiling: M for the price of one · SC 2007 |
Compilers and program optimization › loop transformation
register tiling |
0.1 | 1 | 2007 | Multi-level tiling: M for the price of one · SC 2007 |
Methods — techniques the papers use, named apart from their topics
polyhedral code generation · 0.1parameterized tiling · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Multi-level tiling: M for the price of oneabstractTiling is a widely used loop transformation for exposing/exploiting parallelism and data locality. High-performance implementations use multiple levels of tiling to exploit the hierarchy of parallelism and cache/register locality. Efficient generation of multi-level tiled code is essential for effective use of multi-level tiling. Parameterized tiled code, where tile sizes are not fixed but left as symbolic parameters can enable several dynamic and run-time optimizations. Previous solutions to multi-level tiled loop generation are limited to the case where tile sizes are fixed at compile time. We present an algorithm that can generate multi-level parameterized tiled loops at the same cost as generating single-level tiled loops. The efficiency of our method is demonstrated on several benchmarks. We also present a method-useful in register tiling-for separating partial and full tiles at any arbitrary level of tiling. The code generator we have implemented is available as an open source tool. DaeGon Kim, Lakshminarayanan Renganarayanan, Dave Rostron, Sanjay V. Rajopadhye, Michelle Mills Strout |
SC | 3 |