Chun-Chien Liu

dblp:415/5701 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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
Memory systems · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems › processing-in-memory
near-memory processing
0.912025
UPVSS: Jointly Managing Vector Similarity Search with Near-Memory Processing Systems · DAC 2025
Memory systems
processing-in-memory
0.912025
UPVSS: Jointly Managing Vector Similarity Search with Near-Memory Processing Systems · DAC 2025
Memory systems › processing-in-memory
vector similarity search
0.912025
UPVSS: Jointly Managing Vector Similarity Search with Near-Memory Processing Systems · DAC 2025
Information retrieval
retrieval models
0.312025
UPVSS: Jointly Managing Vector Similarity Search with Near-Memory Processing Systems · DAC 2025
Information retrieval › similarity search
vector similarity search
0.312025
UPVSS: Jointly Managing Vector Similarity Search with Near-Memory Processing Systems · DAC 2025

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

workload partitioning · 1.7offloading · 1.7
YearPublicationVenuePosition
2025 UPVSS: Jointly Managing Vector Similarity Search with Near-Memory Processing Systems
abstract
Vector similarity search plays a pivotal role in modern applications, including recommendation systems, image search, large language models (LLMs), and high-dimensional data retrieval. As data size scales, our research reveals that the search phase imposes substantial demands on DRAM bandwidth, leading to performance limitations in conventional von Neumann architecture with shared memory buses. This data movement bottleneck restricts the efficiency and scalability of vector similarity search due to insufficient memory bandwidth. To mitigate this issue, we leverage UPMEM, an off-the-shelf near-memory processing (NMP) system, to minimize the data movement between memory and compute units. However, UPMEM’s computing engine has certain limitations and requires thorough application integration to unleash its high-parallelism capabilities. In this work, we introduce UPMEM-aware Vector Similarity Search (UPVSS), an architecture-aware system that jointly manages vector similarity search and UPMEM’s NMP technology. UPVSS prioritizes offloading operations based on their strengths and capabilities, effectively alleviating the data movement bottleneck and improving overall system performance.
Chun-Chien Liu, Chun-Feng Wu, Yunho Jin
DAC1