EDBT 2026 Demo / reviewers in the wild / expert
Gerard O'Leary
dblp:207/1810
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2017
—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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 44% Processor architecture and microarchitecture · 44% Energy-efficient computing · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture
data-parallel architecture |
0.3 | 1 | 2017 | Bit-pragmatic deep neural network computing · MICRO 2017 |
Hardware accelerators and domain-specific architectures › machine learning accelerator
DNN accelerator |
0.3 | 1 | 2017 | Bit-pragmatic deep neural network computing · MICRO 2017 |
Energy-efficient computing › energy-efficient architecture
energy-efficient accelerator |
0.1 | 1 | 2017 | Bit-pragmatic deep neural network computing · MICRO 2017 |
Methods — techniques the papers use, named apart from their topics
shift-and-add multiplication · 0.3serial-parallel multiplication · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Bit-pragmatic deep neural network computingabstractDeep Neural Networks expose a high degree of parallelism, making them amenable to highly data parallel architectures. However, data-parallel architectures often accept inefficiency in individual computations for the sake of overall efficiency. We show that on average, activation values of convolutional layers during inference in modern Deep Convolutional Neural Networks (CNNs) contain 92% zero bits. Processing these zero bits entails ineffectual computations that could be skipped. We propose Pragmatic (PRA), a massively data-parallel architecture that eliminates most of the ineffectual computations on-the-fly, improving performance and energy efficiency compared to state-of-the-art high-performance accelerators [5]. The idea behind PRA is deceptively simple: use serial-parallel shift-and-add multiplication while skipping the zero bits of the serial input. However, a straightforward implementation based on shift-and-add multiplication yields unacceptable area, power and memory access overheads compared to a conventional bit-parallel design. PRA incorporates a set of design decisions to yield a practical, area and energy efficient design. Jorge Albericio, Alberto Delmas Lascorz, Patrick Judd, Sayeh Sharify, Gerard O'Leary, Roman Genov, Andreas Moshovos |
MICRO | 5 |