Fei Fang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fei Fang has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Chen Qian
University of California Santa Cruz, Santa Cruz, California, USA
4 shared publications - Yi Liu
University of California Santa Cruz, Santa Cruz, USA
4 shared publications
Latest Publications
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 229-231
d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
We present d-HNSW, an RDMA-based vector search engine for disaggregated memory that overcomes network bottlenecks and layout fragmentation through hardware-algorithm co-designed representative index caching, RDMA-friendly remote storage layout, query-aware loading, and pipelined execution.
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 229-231
Open Accessd-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
We present d-HNSW, an RDMA-based vector search engine for disaggregated memory that overcomes network bottlenecks and layout fragmentation through hardware-algorithm co-designed representative index caching, RDMA-friendly remote storage layout, query-aware loading, and pipelined execution.
- Open Access
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 229-231
d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 229-231
Open Accessd-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
- Open Access
- 29 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 10 (2) , 1-28
d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
Efficient vector search is essential for powering large-scale AI applications, such as LLMs. Existing solutions are designed for monolithic architectures where compute and memory are tightly coupled. Recently, disaggregated architecture breaks this coupling by separating computation and memory resources into independently scalable pools to improve utilization. However, applying vector database to a disaggregated memory system brings unique challenges to system design due to its graph-based index. We present d-HNSW, the first RDMA-based vector search engine optimized for disaggregated memory systems. d-HNSW preserves HNSW's high accuracy while addressing the new system-level challenges introduced by disaggregation: 1) network inefficiency from pointer-chasing traversals, 2) non-contiguous remote memory layout induced by dynamic insertions, 3) redundant data transfers in batch workloads, and 4) resource underutilization due to sequential execution. d-HNSW tackles these challenges through a set of hardware-algorithm co-designed techniques, including 1) balanced clustering with a lightweight representative index to reduce network round-trips and ensure predictable latency, 2) an RDMA-friendly graph layout that preserves data contiguity under dynamic insertions, 3) query-aware data loading to eliminate redundant fetches across batch queries, and 4) a pipelined execution model that overlaps RDMA transfers with computation to hide network latency and improve throughput. Our evaluation results in a public cloud show that d-HNSW achieves up to < 10 -2 × query latency and >100× query throughput compared to other baselines, while maintaining a high recall of 94%.
- 29 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 10 (2) , 1-28
Open Accessd-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
Efficient vector search is essential for powering large-scale AI applications, such as LLMs. Existing solutions are designed for monolithic architectures where compute and memory are tightly coupled. Recently, disaggregated architecture breaks this coupling by separating computation and memory resources into independently scalable pools to improve utilization. However, applying vector database to a disaggregated memory system brings unique challenges to system design due to its graph-based index. We present d-HNSW, the first RDMA-based vector search engine optimized for disaggregated memory systems. d-HNSW preserves HNSW's high accuracy while addressing the new system-level challenges introduced by disaggregation: 1) network inefficiency from pointer-chasing traversals, 2) non-contiguous remote memory layout induced by dynamic insertions, 3) redundant data transfers in batch workloads, and 4) resource underutilization due to sequential execution. d-HNSW tackles these challenges through a set of hardware-algorithm co-designed techniques, including 1) balanced clustering with a lightweight representative index to reduce network round-trips and ensure predictable latency, 2) an RDMA-friendly graph layout that preserves data contiguity under dynamic insertions, 3) query-aware data loading to eliminate redundant fetches across batch queries, and 4) a pipelined execution model that overlaps RDMA transfers with computation to hide network latency and improve throughput. Our evaluation results in a public cloud show that d-HNSW achieves up to < 10 -2 × query latency and >100× query throughput compared to other baselines, while maintaining a high recall of 94%.
- Open Access
- 10 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Efficient Vector Search on Disaggregated Memory with d-HNSW
- 10 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessEfficient Vector Search on Disaggregated Memory with d-HNSW