Demo Data from EDBT 2026 / reviewers in the wild / expert
Gagandeep Goyal
dblp:258/0994
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 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.
| 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 |
Hardware accelerators and domain-specific architectures · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
code generation |
0.5 | 1 | 2021 | PolyDL: Polyhedral Optimizations for Creation of High-performance DL Primitives · ACM Trans. Archit. Code Optim. 2021 |
Compilers and program optimization › loop transformation
polyhedral compilation |
0.5 | 1 | 2021 | PolyDL: Polyhedral Optimizations for Creation of High-performance DL Primitives · ACM Trans. Archit. Code Optim. 2021 |
Hardware accelerators and domain-specific architectures
machine learning accelerator |
0.1 | 1 | 2021 | PolyDL: Polyhedral Optimizations for Creation of High-performance DL Primitives · ACM Trans. Archit. Code Optim. 2021 |
Methods — techniques the papers use, named apart from their topics
polyhedral model · 1.0operator fusion · 1.0auto-tuning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | PolyDL: Polyhedral Optimizations for Creation of High-performance DL PrimitivesabstractDeep Neural Networks (DNNs) have revolutionized many aspects of our lives. The use of DNNs is becoming ubiquitous, including in software for image recognition, speech recognition, speech synthesis, language translation, to name a few. The training of DNN architectures, however, is computationally expensive. Once the model is created, its use in the intended application—the inference task, is computationally heavy too and the inference needs to be fast for real time use. For obtaining high performance today, the code of Deep Learning (DL) primitives optimized for specific architectures by expert programmers exposed via libraries is the norm. However, given the constant emergence of new DNN architectures, creating hand optimized code is expensive, slow and is not scalable. To address this performance-productivity challenge, in this article we present compiler algorithms to automatically generate high-performance implementations of DL primitives that closely match the performance of hand optimized libraries. We develop novel data reuse analysis algorithms using the polyhedral model to derive efficient execution schedules automatically. In addition, because most DL primitives use some variant of matrix multiplication at their core, we develop a flexible framework where it is possible to plug in library implementations of the same in lieu of a subset of the loops. We show that such a hybrid compiler plus a minimal library-use approach results in state-of-the-art performance. We develop compiler algorithms to also perform operator fusions that reduce data movement through the memory hierarchy of the computer system. Using Convolution Neural Network (CNN) models and matrix multiplication operations, we demonstrate that our approach automatically creates high performing DNN building blocks whose performance matches the performance of hand-crafted kernels of Intel’s oneDNN library on high end CPUs. At the same time, our techniques take only a fraction of time (1/20 or less) compared to AutoTVM, a deep learning auto-tuner to create optimized implementations. Sanket Tavarageri, Alexander Heinecke, Sasikanth Avancha, Bharat Kaul, Gagandeep Goyal, Ramakrishna Upadrasta |
ACM Trans. Archit. Code Optim. | 5 |