Kang Chen

Kang Chen

Auto-generated profile, based on publicly available information

Kang Chen

Tsinghua University, Beijing, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 October 2023
Verified
Conference Paper
Open access
MZMingxing Zhang
Mingxing Zhang
TMTeng Ma
Teng Ma
JHJinqi Hua
Jinqi Hua
ZLZheng Liu
Zheng Liu
KCKang Chen
Kang Chen
YWYongwei Wu
Yongwei Wu

12 July 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SMShaonan Ma
Shaonan Ma
TMTeng Ma
Teng Ma
KCKang Chen
Kang Chen
YWYongwei Wu
Yongwei Wu
Remote Direct Memory Access (RDMA) based network devices are increasingly being deployed in modern data centers. RDMA brings significant performance improvements over traditional network devices such as Ethernet due to its unique features: protocol offloading and memory semantics . In particular, it can achieve microsecond level latency, which is about 2 $\sim$ 3 orders of magnitude improvement. With such improvement in hardware, the software stack, including device drivers and programming libraries, is becoming a new performance bottleneck. Developers need to use new programming libraries to take full advantage of the performance of the underlying hardware. Storage systems are very important in modern data centers. This article surveys the current efforts to use RDMA for optimizing storage systems. We first present five classes of RDMA-based storage systems, including key-value stores, file systems, distributed memory systems, database systems, and systems using smart NICs, to demonstrate different design choices. Then, we examine the core modules of storage systems from different perspectives: communication mode, concurrency control, fault tolerance, caching, and resource management. Finally, we provide some design guidelines for new RDMA-based storage systems, as well as a discussion of opportunities and challenges.

4 November 2024
Verified
Conference Paper
Open access
JHJialiang Huang
Jialiang Huang
MZMingXing Zhang
MingXing Zhang
TMTeng Ma
Teng Ma
ZLZheng Liu
Zheng Liu
SLSixing Lin
Sixing Lin
YWYongWei Wu
YongWei Wu
Serverless computing is renowned for its computation elasticity, yet its full potential is often constrained by the requirement for functions to operate within local and dedicated background environments, resulting in limited memory elasticity. To address this limitation, this paper introduces TrEnv, a co-designed integration of the serverless platform with the operating system and CXL/RDMA-based remote memory pools in two key areas. Firstly, TrEnv introduces repurposable sandboxes, which can be shared across different functions and hence, substantially decrease the overhead associated with creating isolation sandboxes. Secondly, it augments the OS with "memory templates" that enable rapid restoration of function states stored on remote memory. These innovations allow TrEnv to facilitate rapid transitions between instances of different functions and enable memory sharing across multiple nodes. Our evaluations using a variety of representative and real-world workloads demonstrate that TrEnv can initiate a container within 10 milliseconds, achieving up to a 7× speedup in P99 end-to-end latency and reducing memory usage by 48% on average compared to state-of-the-art on-demand restoring systems.

17 April 2024
Verified
Conference Paper
Open access
FRFeng Ren
Feng Ren
MZMingxing Zhang
Mingxing Zhang
KCKang Chen
Kang Chen
HXHuaxia Xia
Huaxia Xia
ZCZuoning Chen
Zuoning Chen
YWYongwei Wu
Yongwei Wu
Recent developments in RDMA networks are leading to the trend of memory disaggregation. However, the performance of each compute node is still limited by the network, especially when it needs to perform a large number of concurrent fine-grained remote accesses. According to our evaluations, existing IOPS-bound disaggregated applications do not scale well beyond 32 cores, and therefore do not take full advantage of today's many-core machines. After an in-depth analysis of the internal architecture of RNIC, we found three major scale-up bottlenecks that limit the throughput of today's disaggregated applications: (1) implicit contention of doorbell registers, (2) cache trashing caused by excessive outstanding work requests, and (3) wasted IOPS from unsuccessful CAS retries. However, the solutions to these problems involve many low-level details that are not familiar to application developers. To ease the burden on developers, we propose Smart, an RDMA programming framework that hides the above details by providing an interface similar to one-sided RDMA verbs. We take 44 and 16 lines of code to refactor the state-of-the-art disaggregated hash table (RACE) and persistent transaction processing system (FORD) with Smart, improving their throughput by up to 132.4× and 5.2×, respectively. We have also refactored Sherman (a recent disaggregated B+Tree) with Smart and an additional speculative lookup optimization (48 lines of code changed), which changes its memory access pattern from bandwidth-bound to IOPS-bound and leads to a speedup of 2.0×. Smart is publicly available at https://github.com/madsys-dev/smart.

10 February 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
QXQian Xu
Qian Xu
JYJuan Yang
Juan Yang
FZFeng Zhang
Feng Zhang
JPJunda Pan
Junda Pan
KCKang Chen
Kang Chen
XDXiaoyong Du
Xiaoyong Du
Approximate Nearest Neighbor Search (ANNS) is a critical problem in vector databases. Cluster-based index is utilized to narrow the search scope of ANNS, thereby accelerating the search process. Due to its scalability, it is widely employed in real-world vector search systems. However, existing cluster-based indexes often suffer from coarse granularity, requiring query vectors to compute distances with vectors of varying quality, thus increasing query complexity. Existing work aim to represent vectors with minimal cost, such as using product quantization (PQ) or linear transformations, to speed up ANNS. However, these approaches do not address the coarse granularity inherent in cluster-based index. In this paper, we present an efficient vector data query engine to enhance the granularity of cluster-based index by carefully subdividing clusters using diverse distance metrics. Building on this refined index, we introduce techniques that leverage triangle inequalities to develop highly optimized and distinct search strategies for clusters and vectors of varying qualities, thereby reducing the overhead of ANNS. Extensive experiments demonstrate that our method significantly outperforms existing in-memory cluster-based indexing algorithms, achieving up to an impressive 10× speedup and a pruning ratio exceeding 99.4%.

27 August 2025
Verified
Conference Paper
Open access
YZYinchao Zhang
Yinchao Zhang
SYSu Yao
Su Yao
YFYong Feng
Yong Feng
KCKang Chen
Kang Chen
Tong LiTong Li
Tong Li
KXKe Xu
Ke Xu