VLDB 2026 Research / reviewers in the wild / expert
Chanyoung Yoo
dblp:362/8930
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · conflict
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 |
Memory systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › DRAM › DRAM microarchitecture
bank-level parallelism |
0.7 | 1 | 2023 | AESPA: Asynchronous Execution Scheme to Exploit Bank-Level Parallelism of Processing-in-Memory · MICRO 2023 |
Memory systems
DRAM |
0.7 | 1 | 2023 | AESPA: Asynchronous Execution Scheme to Exploit Bank-Level Parallelism of Processing-in-Memory · MICRO 2023 |
Memory systems
processing-in-memory |
0.7 | 1 | 2023 | AESPA: Asynchronous Execution Scheme to Exploit Bank-Level Parallelism of Processing-in-Memory · MICRO 2023 |
Memory systems › memory controller
memory controller scheduling |
0.2 | 1 | 2023 | AESPA: Asynchronous Execution Scheme to Exploit Bank-Level Parallelism of Processing-in-Memory · MICRO 2023 |
Methods — techniques the papers use, named apart from their topics
matrix-vector multiplication restructuring · 0.7asynchronous execution · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | AESPA: Asynchronous Execution Scheme to Exploit Bank-Level Parallelism of Processing-in-MemoryabstractThis paper presents an asynchronous execution scheme to leverage the bank-level parallelism of near-bank processing-in-memory (PIM). We observe that performing memory operations underutilizes the parallelism of PIM computation because near-bank PIMs are designated to operate all banks synchronously. The all-bank computation can be delayed when one of the banks performs the basic memory commands, such as read/write requests and activation/precharge operations. We aim to mitigate the throughput degradation and especially focus on execution delay caused by activation/precharge operations. For all-bank execution accessing the same row of all banks, a large number of activation/precharge operations inevitably occur. Considering the timing parameter limiting the rate of row-open operations (tFAW), the throughput might decrease even further. To resolve this activation/precharge overhead, we propose AESPA, a new parallel execution scheme that operates banks asynchronously. AESPA is different from the previous synchronous execution in that (1) the compute command of AESPA targets a single bank, and (2) each processing unit computes data stored in multiple DRAM columns. By doing so, while one bank computes multiple DRAM columns, the memory controller issues activation/precharge or PIM compute commands to other banks. Thus, AESPA hides the activation latency of PIM computation and fully utilizes the aggregated bandwidth of the banks. For this, we modify hardware and software to support vector and matrix computation of previous near-bank PIM architectures. In particular, we change the matrix-vector multiplication based on an inner product to fit it on AESPA PIM. Previous matrix-vector multiplication requires data broadcasting and simultaneous computation across all processing units. By changing the matrix-vector multiplication method, AESPA PIM can transfer data to respective processing units and start computation asynchronously. As a result, the near-bank PIMs adopting AESPA achieve 33.5% and 59.5% speedup compared to two different state-of-the-art PIMs. Hongju Kal, Chanyoung Yoo, Won Woo Ro |
MICRO | 2 |