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

Alexander Glass

dblp:303/9923 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 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
2 papers
Memory systems · 68% Processor architecture and microarchitecture · 27% Parallel and multicore computing · 5%

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

TopicWeightPapersLastEvidence papers
Memory systems › processing-in-memory
computing-in-memory
1.522026
The Memory Processing Unit: A Generalized Interface for End-to-End In-Memory Execution · HPCA 2026
RACER: Bit-Pipelined Processing Using Resistive Memory · MICRO 2021
Memory systems
processing-in-memory
1.522026
The Memory Processing Unit: A Generalized Interface for End-to-End In-Memory Execution · HPCA 2026
RACER: Bit-Pipelined Processing Using Resistive Memory · MICRO 2021
Processor architecture and microarchitecture
instruction set architecture
1.012026
The Memory Processing Unit: A Generalized Interface for End-to-End In-Memory Execution · HPCA 2026
Processor architecture and microarchitecture › computer arithmetic
bit-serial arithmetic
0.512021
RACER: Bit-Pipelined Processing Using Resistive Memory · MICRO 2021
Memory systems › non-volatile memory
resistive memory
0.512021
RACER: Bit-Pipelined Processing Using Resistive Memory · MICRO 2021
Parallel and multicore computing › parallel computation models
parallel execution models
0.312026
The Memory Processing Unit: A Generalized Interface for End-to-End In-Memory Execution · HPCA 2026
Memory systems
emerging memory technologies
0.112021
RACER: Bit-Pipelined Processing Using Resistive Memory · MICRO 2021
Memory systems
non-volatile memory
0.112021
RACER: Bit-Pipelined Processing Using Resistive Memory · MICRO 2021

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

microarchitecture-agnostic interface design · 1.0boolean primitives · 0.5bit-pipelined processing · 0.5
YearPublicationVenuePosition
2026 The Memory Processing Unit: A Generalized Interface for End-to-End In-Memory Execution
abstract
The processing-using-memory (PUM; a.k.a. inmemory computing) paradigm aims to eliminate data movement energy and performance costs by using memory cell interactions to directly perform computation. Given PUM's potential for large savings, prior works have proposed many different datapath microarchitectures to demonstrate how general-purpose PUM benefits a wide range of application kernels. Unfortunately, these efforts largely depend on microarchitecture-specific vector-like interfaces that (1) force many of an application's operations to be offloaded to a CPU, (2) require significant programmer effort to scale up applications to an entire memory chip, and (3) make it impractical to develop badly-needed systems software and programming tools for PUM. To address these three issues, we propose the memory processing unit (MPU), a microarchitecture-agnostic interface layer for general-purpose PUM with three components. First, we develop an MPU instruction set architecture (ISA) with instructions to facilitate application scaling and task coordination. Second, we propose an ensemble execution model that coordinates execution across millions of PUM vector function units and maps to most general-purpose PUM microarchitectures. Third, we design a comprehensive MPU control path that efficiently executes MPU ISA binaries across multiple ensembles, and can enable CPU-free execution of complex end-to-end applications with PUM. We demonstrate how the MPU maps to multiple previously-proposed PUM datapaths, and how it achieves average performance/energy improvements of$\mathbf{1. 7 9} \times \boldsymbol{/} \mathbf{3. 2 3} \times$for$\mathbf{2 1}$data-intensive kernels over these prior works ($67 \times / 47 \times$vs. a modern GPU), while also achieving performance and energy improvements for the complex end-to-end applications.
Minh S. Q. Truong, Yiqiu Sun 0002, Dawei Xiong, Amol Shah 0001, Alexander Glass, Abraham Farrell, James A. Bain, L. Richard Carley, Saugata Ghose
HPCA5
2021 RACER: Bit-Pipelined Processing Using Resistive Memory
abstract
To combat the high energy costs of moving data between main memory and the CPU, recent works have proposed to perform processing-using-memory (PUM), a type of processing-in-memory where operations are performed on data in situ (i.e., right at the memory cells holding the data). Several common and emerging memory technologies offer the ability to perform bitwise Boolean primitive functions by having interconnected cells interact with each other, eliminating the need to use discrete CMOS compute units for several common operations. Recent PUM architectures extend upon these Boolean primitives to perform bit-serial computation using memory. Unfortunately, several practical limitations of the underlying memory devices restrict how large emerging memory arrays can be, which hinders the ability of conventional bit-serial computation approaches to deliver high performance in addition to large energy savings.
Minh S. Q. Truong, Deanyone Su, Liting Shen, Alexander Glass, L. Richard Carley, James A. Bain, Saugata Ghose
MICRO5