EDBT 2026 Demo / reviewers in the wild / expert
Gang Ren 0002
dblp:75/3931-2
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2006
0000-0003-4689-0099ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
High-performance computing · 81% Processor architecture and microarchitecture · 10% Performance modeling and evaluation · 9% | |
| Software engineering, system software, and programming languages
3 papers |
Compilers and program optimization · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › vectorization
SIMD vectorization |
0.1 | 1 | 2006 | Optimizing data permutations for SIMD devices · PLDI 2006 |
High-performance computing › performance optimization
auto-tuning |
0.1 | 1 | 2005 | Is Search Really Necessary to Generate High-Performance BLAS? · Proc. IEEE 2005 |
High-performance computing
performance optimization at scale |
0.1 | 1 | 2005 | Is Search Really Necessary to Generate High-Performance BLAS? · Proc. IEEE 2005 |
High-performance computing
numerical linear algebra |
0.0 | 1 | 2003 | A comparison of empirical and model-driven optimization · PLDI 2003 |
Processor architecture and microarchitecture
SIMD |
0.0 | 1 | 2006 | Optimizing data permutations for SIMD devices · PLDI 2006 |
Performance modeling and evaluation
benchmarking |
0.0 | 1 | 2005 | Is Search Really Necessary to Generate High-Performance BLAS? · Proc. IEEE 2005 |
Methods — techniques the papers use, named apart from their topics
global search · 0.1analytical performance modeling · 0.1model-driven optimization · 0.1empirical optimization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Optimizing data permutations for SIMD devices
Gang Ren 0002, Peng Wu 0001, David A. Padua |
PLDI | 1 |
| 2005 | Is Search Really Necessary to Generate High-Performance BLAS?abstractA key step in program optimization is the estimation of optimal values for parameters such as tile sizes and loop unrolling factors. Traditional compilers use simple analytical models to compute these values. In contrast, library generators like ATLAS use global search over the space of parameter values by generating programs with many different combinations of parameter values, and running them on the actual hardware to determine which values give the best performance. It is widely believed that traditional model-driven optimization cannot compete with search-based empirical optimization because tractable analytical models cannot capture all the complexities of modern high-performance architectures, but few quantitative comparisons have been done to date. To make such a comparison, we replaced the global search engine in ATLAS with a model-driven optimization engine and measured the relative performance of the code produced by the two systems on a variety of architectures. Since both systems use the same code generator, any differences in the performance of the code produced by the two systems can come only from differences in optimization parameter values. Our experiments show that model-driven optimization can be surprisingly effective and can generate code with performance comparable to that of code generated by ATLAS using global search. Kamen Yotov, Xiaoming Li 0004, Gang Ren 0002, María Jesús Garzarán, David A. Padua, Keshav Pingali, Paul Stodghill |
Proc. IEEE | 3 |
| 2003 | A comparison of empirical and model-driven optimizationabstractEmpirical program optimizers estimate the values of key optimization parameters by generating different program versions and running them on the actual hardware to determine which values give the best performance. In contrast, conventional compilers use models of programs and machines to choose these parameters. It is widely believed that model-driven optimization does not compete with empirical optimization, but few quantitative comparisons have been done to date. To make such a comparison, we replaced the empirical optimization engine in ATLAS (a system for generating a dense numerical linear algebra library called the BLAS) with a model-driven optimization engine that used detailed models to estimate values for optimization parameters, and then measured the relative performance of the two systems on three different hardware platforms. Our experiments show that model-driven optimization can be surprisingly effective, and can generate code whose performance is comparable to that of code generated by empirical optimizers for the BLAS. Kamen Yotov, Xiaoming Li 0004, Gang Ren 0002, Michael Cibulskis, Gerald DeJong, María Jesús Garzarán, David A. Padua, Keshav Pingali, Paul Stodghill, Peng Wu 0001 |
PLDI | 3 |