Jing Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jing Liu has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Arpaci-Dusseau
University of Wisconsin–Madison, Madison, Wisconsin, USA
4 shared publications - Remzi H. Arpaci-Dusseau
University of Wisconsin–Madison, Madison, Wisconsin, USA
4 shared publications - Shawn (Wanxiang) Zhong
University of Wisconsin-Madison, Madison, Wisconsin, USA
2 shared publications - Anand Bonde
Microsoft Research, Dulles, Virginia, USA
1 shared publication - Changwoo Min
Igalia
1 shared publication - Chuandong Li
Peking University, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 353-378
Don't Let AI Agents YOLO Your Files: Information and Control in Agent-Native Filesystems
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 353-378
Open AccessDon't Let AI Agents YOLO Your Files: Information and Control in Agent-Native Filesystems
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 479-495
Aeolia: A Fast and Secure Userspace Interrupt-Based Storage Stack
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 479-495
Open AccessAeolia: A Fast and Secure Userspace Interrupt-Based Storage Stack
- Open Access
- 11 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 8-14
ML-native Dataplane Operating Systems
- 11 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 8-14
Open AccessML-native Dataplane Operating Systems
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 21-41
Revealing the Unstable Foundations of eBPF-Based Kernel Extensions
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 21-41
Open AccessRevealing the Unstable Foundations of eBPF-Based Kernel Extensions
- Open Access
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 15-22
Shadow Filesystems: Recovering from Filesystem Runtime Errors via Robust Alternative Execution
We present Robust Alternative Execution (RAE), an approach to transparently mask runtime errors in performance-oriented filesystems via temporarily executing an alternative shadow filesystem. A shadow filesystem has the primary goal of robustness, achieved through a simple implementation without performance optimizations and concurrency while adhering to the same API and on-disk formats as the base filesystem it enhances. While the base performance-oriented filesystem may contain bugs, the shadow implementation is formally verified, leveraging advancements in the verification of low-level systems code. In the common case, the base filesystem executes and delivers high performance to applications; however, when a bug is triggered, the slow-but-correct shadow takes over, updates state correctly, and then resumes the base, thus providing high availability.
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 15-22
Open AccessShadow Filesystems: Recovering from Filesystem Runtime Errors via Robust Alternative Execution
We present Robust Alternative Execution (RAE), an approach to transparently mask runtime errors in performance-oriented filesystems via temporarily executing an alternative shadow filesystem. A shadow filesystem has the primary goal of robustness, achieved through a simple implementation without performance optimizations and concurrency while adhering to the same API and on-disk formats as the base filesystem it enhances. While the base performance-oriented filesystem may contain bugs, the shadow implementation is formally verified, leveraging advancements in the verification of low-level systems code. In the common case, the base filesystem executes and delivers high performance to applications; however, when a bug is triggered, the slow-but-correct shadow takes over, updates state correctly, and then resumes the base, thus providing high availability.
- Open Access
- 6 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 19 (2) , 1-47
Principled Schedulability Analysis for Distributed Storage Systems Using Thread Architecture Models
In this article, we present an approach to systematically examine the schedulability of distributed storage systems, identify their scheduling problems, and enable effective scheduling in these systems. We use Thread Architecture Models (TAMs) to describe the behavior and interactions of different threads in a system, and show both how to construct TAMs for existing systems and utilize TAMs to identify critical scheduling problems. We specify three schedulability conditions that a schedulable TAM should satisfy: completeness, local enforceability, and independence; meeting these conditions enables a system to easily support different scheduling policies. We identify five common problems that prevent a system from satisfying the schedulability conditions, and show that these problems arise in existing systems such as HBase, Cassandra, MongoDB, and Riak, making it difficult or impossible to realize various scheduling disciplines. We demonstrate how to address these schedulability problems using both direct and indirect solutions, with different trade-offs. To show how to apply our approach to enable scheduling in realistic systems, we develop Tamed-HBase and Muzzled-HBase, sets of modifications to HBase that can realize the desired scheduling disciplines, including fairness and priority scheduling, even when presented with challenging workloads.
- 6 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 19 (2) , 1-47
Open AccessPrincipled Schedulability Analysis for Distributed Storage Systems Using Thread Architecture Models
In this article, we present an approach to systematically examine the schedulability of distributed storage systems, identify their scheduling problems, and enable effective scheduling in these systems. We use Thread Architecture Models (TAMs) to describe the behavior and interactions of different threads in a system, and show both how to construct TAMs for existing systems and utilize TAMs to identify critical scheduling problems. We specify three schedulability conditions that a schedulable TAM should satisfy: completeness, local enforceability, and independence; meeting these conditions enables a system to easily support different scheduling policies. We identify five common problems that prevent a system from satisfying the schedulability conditions, and show that these problems arise in existing systems such as HBase, Cassandra, MongoDB, and Riak, making it difficult or impossible to realize various scheduling disciplines. We demonstrate how to address these schedulability problems using both direct and indirect solutions, with different trade-offs. To show how to apply our approach to enable scheduling in realistic systems, we develop Tamed-HBase and Muzzled-HBase, sets of modifications to HBase that can realize the desired scheduling disciplines, including fairness and priority scheduling, even when presented with challenging workloads.