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

Chih-Yu Hu

dblp:415/5530 · 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 · 92% Storage systems · 8%

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

TopicWeightPapersLastEvidence papers
Memory systems
content-addressable memory
0.912025
Energy-Efficient Large-Scale Vector Similarity Search in NAND-Flash via Hybrid Matching · DAC 2025
Memory systems › in-memory computing
in-memory search accelerator
0.912025
Energy-Efficient Large-Scale Vector Similarity Search in NAND-Flash via Hybrid Matching · DAC 2025
Memory systems
processing-in-memory
0.912025
Energy-Efficient Large-Scale Vector Similarity Search in NAND-Flash via Hybrid Matching · DAC 2025
Storage systems › flash and SSD › flash memory › NAND flash
3D NAND flash
0.312025
Energy-Efficient Large-Scale Vector Similarity Search in NAND-Flash via Hybrid Matching · DAC 2025
Memory systems
non-volatile memory
0.312025
Energy-Efficient Large-Scale Vector Similarity Search in NAND-Flash via Hybrid Matching · DAC 2025

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

search voltage shift · 0.9range encoding · 0.9filtering-aware training · 0.9
YearPublicationVenuePosition
2025 Energy-Efficient Large-Scale Vector Similarity Search in NAND-Flash via Hybrid Matching
abstract
Vector similarity search (VSS) is crucial in many AI applications, such as few-shot learning (FSL) and approximate nearest-neighbor search (ANNS), but it demands significant memory capacity and incurs substantial energy costs for data transfers during large-scale comparisons. Various in-memory search technologies have been developed to improve energy efficiency, with NAND-based multi-bit content-addressable memory (MCAM) standing out as a promising solution for its high density and large capacity. MCAM can operate in exact-search (ES) mode, supporting only perfect matches with low energy cost, or in approximate-search (AS) mode, enabling flexible VSS. However, AS mode incurs significant energy waste when comparing queries with non-target stored vectors. To address this issue, we propose Hybrid-M, a 3D NAND-based in-memory VSS architecture that integrates both modes into a single hybrid matching process, using ES mode as a filter to reduce redundant searches for AS mode. We apply three techniques to optimize this integration: range encoding for multi-level cells (MLC) to enhance filtering, search voltage shifts to mitigate the impact on AS accuracy and reduce matching currents, and a filtering-aware training method to further improve reliability and energy efficiency. Results show that Hybrid-M achieves comparable accuracy while reducing energy consumption by 67% to 83% compared to MACM-based VSS using only AS mode, across various many-class FSL and ANNS workloads.
Chih-Yu Hu, Chi-Tse Huang, Hao-Wei Chiang, Hsiang-Yun Cheng, Po-Hao Tseng, Ming-Hsiu Lee, An-Yeu Wu
DAC1