Kang Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Kang Chen has a total of 147 co-authors. Here are the top co-authors by number of shared publications:
- Yongwei Wu
Tsinghua University, Beijing, China
16 shared publications - Mingxing Zhang
Tsinghua University, Beijing, China
7 shared publications - Jinlei Jiang
Tsinghua University, Beijing, China
6 shared publications - Teng Ma
Alibaba Group, Hangzhou, Zhejiang, China
5 shared publications - Weimin Zheng
Department of Computer Science and Technology, Tsinghua University, Beijing, China
4 shared publications - Keyang Hu
Tsinghua University, Beijing, China
3 shared publications
Latest Publications
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 499-515
Turning Linux into a High-Performance Library OS with Flux
Modern high-performance applications increasingly bypass the host kernel for I/O and scheduling and rely on library OSes for operating-system services. High-performance library OSes are often built from scratch, but supporting unmodified applications requires reimplementing mature Linux semantics. Running Linux itself as a library OS avoids this cost, yet existing Linux-based designs remain slow. Our analysis of LKL shows that the main bottlenecks lie in the surrounding user-space runtime rather than Linux subsystems. We present Flux, a Linux-based library OS that reduces the runtime bottlenecks while keeping Linux subsystems largely intact. Flux redesigns scheduling, user-space interrupt delivery, and syscall paths, and introduces a new process abstraction that supports Linux fork semantics without giving up direct-call syscalls. Flux improves Nginx throughput by up to 18.5Ă— over Linux, and approaches Junction's Memcached throughput under a 100ÎĽs p99 latency target, showing that Linux can provide a high-performance library OS without rebuilding Linux functionality from scratch.
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 499-515
Open AccessTurning Linux into a High-Performance Library OS with Flux
Modern high-performance applications increasingly bypass the host kernel for I/O and scheduling and rely on library OSes for operating-system services. High-performance library OSes are often built from scratch, but supporting unmodified applications requires reimplementing mature Linux semantics. Running Linux itself as a library OS avoids this cost, yet existing Linux-based designs remain slow. Our analysis of LKL shows that the main bottlenecks lie in the surrounding user-space runtime rather than Linux subsystems. We present Flux, a Linux-based library OS that reduces the runtime bottlenecks while keeping Linux subsystems largely intact. Flux redesigns scheduling, user-space interrupt delivery, and syscall paths, and introduces a new process abstraction that supports Linux fork semantics without giving up direct-call syscalls. Flux improves Nginx throughput by up to 18.5Ă— over Linux, and approaches Junction's Memcached throughput under a 100ÎĽs p99 latency target, showing that Linux can provide a high-performance library OS without rebuilding Linux functionality from scratch.
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1531-1544
Forewarned is Forearmed: A Responsive Congestion Control with Non-intrusive Uplink Dynamics Capture
The cellular uplink is increasingly important for modern applications but poses significant challenges to congestion control algorithms (CCAs), due to the highly dynamic conditions and complex operations. Existing CCA paradigms, mainly for downloading data, are unable to react promptly to uplink fluctuations because they rely on ACKs to indicate congestion, introducing inevitable control loop latency. Furthermore, the cost associated with modifications to both the sender and receiver cannot be overlooked. We observe a fundamental opportunity in uplink scenarios: the sender's proximity to the wireless-side allows for fast and accurate control without relying on ACK-based feedback, and requires no modifications to either the receiver-side or the hardware layer. In this paper, we propose Aether, mainly consisting of: (1) a monitor deployed on the driver-layer that captures uplink dynamics, by leveraging our key finding that driver buffer dynamics serve as an indicator of uplink congestion; (2) a bottleneck detector that activates Aether when the uplink becomes the bottleneck; (3) a rate controller that steers transmission toward uplink capacity. We implement Aether on commercial devices and develop a trace-driven emulator for testing Aether. Extensive evaluations demonstrate that Aether outperforms state-of-the-art schemes, improving average throughput by 9.28% to 234.11% while consistently reducing latency by 5.34% to 56.94%.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1531-1544
Open AccessForewarned is Forearmed: A Responsive Congestion Control with Non-intrusive Uplink Dynamics Capture
The cellular uplink is increasingly important for modern applications but poses significant challenges to congestion control algorithms (CCAs), due to the highly dynamic conditions and complex operations. Existing CCA paradigms, mainly for downloading data, are unable to react promptly to uplink fluctuations because they rely on ACKs to indicate congestion, introducing inevitable control loop latency. Furthermore, the cost associated with modifications to both the sender and receiver cannot be overlooked. We observe a fundamental opportunity in uplink scenarios: the sender's proximity to the wireless-side allows for fast and accurate control without relying on ACK-based feedback, and requires no modifications to either the receiver-side or the hardware layer. In this paper, we propose Aether, mainly consisting of: (1) a monitor deployed on the driver-layer that captures uplink dynamics, by leveraging our key finding that driver buffer dynamics serve as an indicator of uplink congestion; (2) a bottleneck detector that activates Aether when the uplink becomes the bottleneck; (3) a rate controller that steers transmission toward uplink capacity. We implement Aether on commercial devices and develop a trace-driven emulator for testing Aether. Extensive evaluations demonstrate that Aether outperforms state-of-the-art schemes, improving average throughput by 9.28% to 234.11% while consistently reducing latency by 5.34% to 56.94%.
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 144-159
iRoute: Local Routing Table-based Workflow Management in Serverless Computing
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 144-159
Open AccessiRoute: Local Routing Table-based Workflow Management in Serverless Computing
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 605-623
SKernel: An Elastic and Efficient Secure Container System at Scale with a Split-Kernel Architecture
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 605-623
Open AccessSKernel: An Elastic and Efficient Secure Container System at Scale with a Split-Kernel Architecture
- Open Access
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4  (1) , 1-24
One DBMS, Two Modes, and a Bunch of Bugs: Catching Logic Bugs in Distributed DBMSs via Differential Testing
Logic bugs in distributed database management systems silently yield incorrect results and are difficult to detect, yet they threaten correctness in critical deployments. Existing testing techniques focus mainly on system level failures or general DBMS and do not target distributed execution, leaving many distributed logic bugs undiscovered. We present DistSQL, a differential testing framework that compares the results of identical SQL queries executed on the same DBMS configured in centralized and distributed modes. The key insight is that centralized execution is simpler and typically better tested, and thus can serve as a practical reference for distributed execution. DistSQL addresses two difficulties that hinder effective bug finding in distributed settings: it performs distributed diversity oriented database state mutation to expose distribution specific behaviors, and it conducts distributed interaction guided exploration of the execution space using query plan features to prioritize novel behaviors over redundant tests. DistSQL requires no intrusive code instrumentation. The evaluation on five popular open source distributed DBMSs, including TiDB, CockroachDB, YugabyteDB, ClickHouse, and OceanBase, as well as one widely deployed commercial DBMS, demonstrates the efficacy of DistSQL. DistSQL identified 65 previously unknown logic bugs, including 38 specific to distributed execution. Of these, 61 have been confirmed and 50 have been fixed.
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4  (1) , 1-24
Open AccessOne DBMS, Two Modes, and a Bunch of Bugs: Catching Logic Bugs in Distributed DBMSs via Differential Testing
Logic bugs in distributed database management systems silently yield incorrect results and are difficult to detect, yet they threaten correctness in critical deployments. Existing testing techniques focus mainly on system level failures or general DBMS and do not target distributed execution, leaving many distributed logic bugs undiscovered. We present DistSQL, a differential testing framework that compares the results of identical SQL queries executed on the same DBMS configured in centralized and distributed modes. The key insight is that centralized execution is simpler and typically better tested, and thus can serve as a practical reference for distributed execution. DistSQL addresses two difficulties that hinder effective bug finding in distributed settings: it performs distributed diversity oriented database state mutation to expose distribution specific behaviors, and it conducts distributed interaction guided exploration of the execution space using query plan features to prioritize novel behaviors over redundant tests. DistSQL requires no intrusive code instrumentation. The evaluation on five popular open source distributed DBMSs, including TiDB, CockroachDB, YugabyteDB, ClickHouse, and OceanBase, as well as one widely deployed commercial DBMS, demonstrates the efficacy of DistSQL. DistSQL identified 65 previously unknown logic bugs, including 38 specific to distributed execution. Of these, 61 have been confirmed and 50 have been fixed.
- Open Access
- 28 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44  (3) , 1-39
TrEnv-X: Transparently Share Serverless Execution Environments Across Different Functions and Nodes
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-X , a co-designed integration of the serverless platform with the operating system and CXL/RDMA-based remote memory pools. TrEnv-X ’s core innovations are repurposable sandboxes, which can be shared across different functions to decrease the associated creation overhead, and OS-level memory templates, which enable rapid state restoration from CXL/RDMA-based remote memory pools. To further demonstrate TrEnv-X ’s versatility, we generalize its design from traditional containers for microVM-based agent workloads and introduce new optimizations, including browser sharing and a page cache bypassing mechanism. Our evaluation shows that TrEnv-X achieves up to 7 × reduction in P99 latency and 48% memory savings for container-based functions. When applied to LLM agents, it reduces the P99 latency by up to 58% and memory usage by 61% compared to state-of-the-art systems like E2B.
- 28 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44  (3) , 1-39
Open AccessTrEnv-X: Transparently Share Serverless Execution Environments Across Different Functions and Nodes
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-X , a co-designed integration of the serverless platform with the operating system and CXL/RDMA-based remote memory pools. TrEnv-X ’s core innovations are repurposable sandboxes, which can be shared across different functions to decrease the associated creation overhead, and OS-level memory templates, which enable rapid state restoration from CXL/RDMA-based remote memory pools. To further demonstrate TrEnv-X ’s versatility, we generalize its design from traditional containers for microVM-based agent workloads and introduce new optimizations, including browser sharing and a page cache bypassing mechanism. Our evaluation shows that TrEnv-X achieves up to 7 × reduction in P99 latency and 48% memory savings for container-based functions. When applied to LLM agents, it reduces the P99 latency by up to 58% and memory usage by 61% compared to state-of-the-art systems like E2B.
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3  (6) , 1-23
Accelerating Stream Processing Engines via Hardware Offloading
Modern stream processing engines (SPEs) must handle massive real-time data streams under strict latency and throughput requirements. However, conventional SPEs are constrained by their software parallelization strategies (e.g., queue-based data re-partitioning, high synchronization overheads, etc.), which prevent efficient utilization of modern hardware capabilities, ultimately limiting performance scalability. In this paper, we present FlexStream, a novel SPE that leverages hardware offloading to redesign the parallelization strategies and overcome these limitations. By offloading data re-partitioning to hardware and integrating a coupled network-executor model, FlexStream maximizes resource utilization, achieving up to 95% network bandwidth saturation. To address the load imbalance challenges introduced by this design, we implement a lock-free state backend with efficient state migration mechanisms. Overall, FlexStream achieves throughput improvements of 1.95 Ă— - 3.35 Ă— compared to state-of-the-art SPEs (e.g., LightSaber) across six real-world streaming analytics applications. FlexStream cuts latency spikes by 71.9% and migration time by 66.8% during state migration, highlighting the benefits of hardware-software co-design in SPEs. Our work underscores the potential of hardware-software co-design in SPEs, offering a scalable, elastic solution for real-time analytics.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3  (6) , 1-23
Open AccessAccelerating Stream Processing Engines via Hardware Offloading
Modern stream processing engines (SPEs) must handle massive real-time data streams under strict latency and throughput requirements. However, conventional SPEs are constrained by their software parallelization strategies (e.g., queue-based data re-partitioning, high synchronization overheads, etc.), which prevent efficient utilization of modern hardware capabilities, ultimately limiting performance scalability. In this paper, we present FlexStream, a novel SPE that leverages hardware offloading to redesign the parallelization strategies and overcome these limitations. By offloading data re-partitioning to hardware and integrating a coupled network-executor model, FlexStream maximizes resource utilization, achieving up to 95% network bandwidth saturation. To address the load imbalance challenges introduced by this design, we implement a lock-free state backend with efficient state migration mechanisms. Overall, FlexStream achieves throughput improvements of 1.95 Ă— - 3.35 Ă— compared to state-of-the-art SPEs (e.g., LightSaber) across six real-world streaming analytics applications. FlexStream cuts latency spikes by 71.9% and migration time by 66.8% during state migration, highlighting the benefits of hardware-software co-design in SPEs. Our work underscores the potential of hardware-software co-design in SPEs, offering a scalable, elastic solution for real-time analytics.
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 928-943
Mantle: Efficient Hierarchical Metadata Management for Cloud Object Storage Services
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 928-943
Open AccessMantle: Efficient Hierarchical Metadata Management for Cloud Object Storage Services
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 692-706
Pegasus: A Universal Framework for Scalable Deep Learning Inference on the Dataplane
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 692-706
Open AccessPegasus: A Universal Framework for Scalable Deep Learning Inference on the Dataplane
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 921-937
AlloyStack: A Library Operating System for Serverless Workflow Applications
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 921-937
Open AccessAlloyStack: A Library Operating System for Serverless Workflow Applications