Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Adam Siemieniuk

dblp:321/0147 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0001-9226-0181ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 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 · 62% Memory systems · 38%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
machine learning compiler
0.612022
OCC: An Automated End-to-End Machine Learning Optimizing Compiler for Computing-In-Memory · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Hardware accelerators and domain-specific architectures › machine learning accelerator
in-memory computing accelerator
0.612022
OCC: An Automated End-to-End Machine Learning Optimizing Compiler for Computing-In-Memory · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Memory systems › emerging memory technologies
memristor crossbar
0.212022
OCC: An Automated End-to-End Machine Learning Optimizing Compiler for Computing-In-Memory · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Memory systems
non-volatile memory
0.212022
OCC: An Automated End-to-End Machine Learning Optimizing Compiler for Computing-In-Memory · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022

Methods — techniques the papers use, named apart from their topics

multilevel rewriting · 1.1
YearPublicationVenuePosition
2022 OCC: An Automated End-to-End Machine Learning Optimizing Compiler for Computing-In-Memory
abstract
Memristive devices promise an alternative approach toward non-Von Neumann architectures, where specific computational tasks are performed within the memory devices. In the machine learning (ML) domain, crossbar arrays of resistive devices have shown great promise for ML inference, as they allow for hardware acceleration of matrix multiplications. But, to enable widespread adoption of these novel architectures, it is critical to have an automatic compilation flow as opposed to relying on a manual mapping of specific kernels on the crossbar arrays. We demonstrate the programmability of memristor-based accelerators using the new compiler design principle of multilevel rewriting, where a hierarchy of abstractions lowers programs level-by-level and perform code transformations at the most suitable abstraction. In particular, we develop a prototype compiler, which progressively lowers a mathematical notation for tensor operations arising in ML workloads, to fixed-function memristor-based hardware blocks.
Adam Siemieniuk, Lorenzo Chelini, Asif Ali Khan, Jerónimo Castrillón, Andi Drebes, Henk Corporaal, Tobias Grosser, Martin Kong
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1