Demo Data from EDBT 2026 / reviewers in the wild / expert
Anghsuman Parashar
dblp:369/5510
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0001-9936-6501ORCID · reported
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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 38% Memory systems · 38% Reconfigurable computing and FPGAs · 12% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
memory hierarchy |
0.7 | 1 | 2023 | Symphony: Orchestrating Sparse and Dense Tensors with Hierarchical Heterogeneous Processing · ACM Trans. Comput. Syst. 2023 |
Hardware accelerators and domain-specific architectures › sparsity exploitation
sparse tensor accelerator |
0.7 | 1 | 2023 | Symphony: Orchestrating Sparse and Dense Tensors with Hierarchical Heterogeneous Processing · ACM Trans. Comput. Syst. 2023 |
GPUs and heterogeneous computing
GPU computing |
0.2 | 1 | 2023 | Symphony: Orchestrating Sparse and Dense Tensors with Hierarchical Heterogeneous Processing · ACM Trans. Comput. Syst. 2023 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Symphony: Orchestrating Sparse and Dense Tensors with Hierarchical Heterogeneous ProcessingabstractSparse tensor algorithms are becoming widespread, particularly in the domains of deep learning, graph and data analytics, and scientific computing. Current high-performance broad-domain architectures, such as GPUs, often suffer memory system inefficiencies by moving too much data or moving it too far through the memory hierarchy. To increase performance and efficiency, proposed domain-specific accelerators tailor their architectures to the data needs of a narrow application domain, but as a result cannot be applied to a wide range of algorithms or applications that contain a mix of sparse and dense algorithms. This article proposes Symphony, a hybrid programmable/specialized architecture that focuses on the orchestration of data throughout the memory hierarchy to simultaneously reduce the movement of unnecessary data and data movement distances. Key elements of the Symphony architecture include (1) specialized reconfigurable units aimed not only at roofline floating-point computations but also at supporting data orchestration features, such as address generation, data filtering, and sparse metadata processing; and (2) distribution of computation resources (both programmable and specialized) throughout the on-chip memory hierarchy. We demonstrate that Symphony can match non-programmable ASIC performance on sparse tensor algebra and provide 31× improved runtime and 44× improved energy over a comparably provisioned GPU for these applications. Michael Pellauer, Jason Clemons, Vignesh Balaji, Neal Clayton Crago, Aamer Jaleel, Donghyuk Lee, Mike O'Connor, Anghsuman Parashar, Sean Treichler, Po-An Tsai, Stephen W. Keckler, Joel S. Emer |
ACM Trans. Comput. Syst. | 8 |