Tao Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Tao Ma has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Teng Ma
Alibaba Group, Hangzhou, Zhejiang, China
6 shared publications - Zheng Liu
Zhejiang University, Alibaba Group, Hangzhou, Zhejiang, China
6 shared publications - Jinlei Jiang
Tsinghua University, Beijing, China
3 shared publications - Kang Chen
Tsinghua University, Beijing, China
3 shared publications - Mingxing Zhang
Tsinghua University, Beijing, China
3 shared publications - Yong Yang
Alibaba Cloud
3 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1514-1528
CacheFS: Peer-to-Peer Cooperative Caching for LLM Weight Distribution at Cloud Scale
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1514-1528
Open AccessCacheFS: Peer-to-Peer Cooperative Caching for LLM Weight Distribution at Cloud Scale
- Open Access
- 5 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
PLUGSCHED+: Efficient and General Live Update and Recovery for Linux Scheduler
The scheduler is a critical component of the operating system (OS) and is tightly coupled with Linux. Production-level clouds often host various workloads, and these workloads require different schedulers to achieve high performance. Furthermore, the scheduler may encounter faults during runtime, leading to the kernel panic. Thus the capability of updating and recovering the scheduler lively without rebooting the OS is crucial for the production environments. However, existing techniques only apply for the fine-grained function-level updates, or require extra constraints such as virtualization when performing update and recovery. We therefore propose Plugsched+ to enable scheduler live update and recovery with two key novelties. First, with the idea of modularization, Plugsched+ decouples the scheduler from the Linux kernel to be an independent module. Second, Plugsched+ uses the data rebuild technique to migrate the state from the old scheduler to the new one during live update, or clear anomalous data during live recovery. This scheme can be directly applied to the Linux kernel scheduler in production environments without replacing the kernel. Experimental and production results show that Plugsched+ can effectively update and recover the scheduler lively, and the downtime is no more than tens of milliseconds.
- 5 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
Open AccessPLUGSCHED+: Efficient and General Live Update and Recovery for Linux Scheduler
The scheduler is a critical component of the operating system (OS) and is tightly coupled with Linux. Production-level clouds often host various workloads, and these workloads require different schedulers to achieve high performance. Furthermore, the scheduler may encounter faults during runtime, leading to the kernel panic. Thus the capability of updating and recovering the scheduler lively without rebooting the OS is crucial for the production environments. However, existing techniques only apply for the fine-grained function-level updates, or require extra constraints such as virtualization when performing update and recovery. We therefore propose Plugsched+ to enable scheduler live update and recovery with two key novelties. First, with the idea of modularization, Plugsched+ decouples the scheduler from the Linux kernel to be an independent module. Second, Plugsched+ uses the data rebuild technique to migrate the state from the old scheduler to the new one during live update, or clear anomalous data during live recovery. This scheme can be directly applied to the Linux kernel scheduler in production environments without replacing the kernel. Experimental and production results show that Plugsched+ can effectively update and recover the scheduler lively, and the downtime is no more than tens of milliseconds.
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3792-3803
ABACI: Automated Downstream Bug Resolution via Semantic-Aware Bisection and Convergent Backporting
Downstream Linux kernel distributions, such as AnolisOS, continuously resolve defects inherited from the upstream codebase. This process requires two labor-intensive tasks: identifying the corresponding upstream fix patches, and adapting them for successful integration into downstream. Existing approaches address these tasks in isolation and suffer from fundamental limitations. Cross-version behavioral inconsistency makes it difficult to reliably verify defect existence and localize the correct fix patch across kernel versions. Besides, even when a fix patch is identified, unresolved prerequisite dependencies and structural divergence between upstream and downstream codebases render direct application infeasible. In this work, we present ABACI, an automated tool for resolving bugs discovered in downstream kernels. ABACI performs a four-phase fix patch localization process, employing semantic-aware bisection to correctly identify the target fix patch across kernel versions despite varying crash manifestations. Then ABACI performs convergent backporting, leveraging state-convergence-based dependency discovery to find prerequisite patches and collecting associated Fixes patches to form a self-consistent patch closure, followed by LLM-based adaptation to handle residual code-level conflicts. We evaluate ABACI on 26 real-world bugs from the Anolis community. ABACI achieves a fix patch localization success rate of 88.5% and a backporting success rate of 91.3%, ourperforming state-of-the-art works. Overall, ABACI has been deployed in the Anolis community, successfully resolving 21 real-world downstream kernel bugs and demonstrating its practical effectiveness.
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3792-3803
Open AccessABACI: Automated Downstream Bug Resolution via Semantic-Aware Bisection and Convergent Backporting
Downstream Linux kernel distributions, such as AnolisOS, continuously resolve defects inherited from the upstream codebase. This process requires two labor-intensive tasks: identifying the corresponding upstream fix patches, and adapting them for successful integration into downstream. Existing approaches address these tasks in isolation and suffer from fundamental limitations. Cross-version behavioral inconsistency makes it difficult to reliably verify defect existence and localize the correct fix patch across kernel versions. Besides, even when a fix patch is identified, unresolved prerequisite dependencies and structural divergence between upstream and downstream codebases render direct application infeasible. In this work, we present ABACI, an automated tool for resolving bugs discovered in downstream kernels. ABACI performs a four-phase fix patch localization process, employing semantic-aware bisection to correctly identify the target fix patch across kernel versions despite varying crash manifestations. Then ABACI performs convergent backporting, leveraging state-convergence-based dependency discovery to find prerequisite patches and collecting associated Fixes patches to form a self-consistent patch closure, followed by LLM-based adaptation to handle residual code-level conflicts. We evaluate ABACI on 26 real-world bugs from the Anolis community. ABACI achieves a fix patch localization success rate of 88.5% and a backporting success rate of 91.3%, ourperforming state-of-the-art works. Overall, ABACI has been deployed in the Anolis community, successfully resolving 21 real-world downstream kernel bugs and demonstrating its practical effectiveness.
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1752-1763
Rethinking Transparent TCP Replacement: Practical Lessons from SMC-R in the Cloud
Transparent TCP acceleration has been a subject of extensive academic research for years, aiming to bypass kernel overhead without modifying legacy applications. Prior work, however, largely emphasizes performance under idealized settings and provides limited discussion of how costs and gains manifest in real production environments. Over the past four years, we have deployed and evaluated SMC-R within Alibaba Cloud to accelerate general cloud workloads. Our experience reveals that transparent TCP replacement is far from "drop-in" in practice. The integration barriers and disruptions to the existing ecosystem incur substantial hidden costs. Furthermore, in many real-world scenarios, the Linux TCP stack is not the dominant performance bottleneck; instead, suboptimal application-layer behaviors and system configurations often exert a more decisive influence on end-to-end gains. These engineering realities explain why transparent TCP replacement remains active in academia but sees limited adoption in production. This paper systematically summarizes the fundamental hurdles we encountered and traces them to their root causes, aiming to provide the community with a more grounded perspective on the costs and benefits of transparent acceleration.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1752-1763
Open AccessRethinking Transparent TCP Replacement: Practical Lessons from SMC-R in the Cloud
Transparent TCP acceleration has been a subject of extensive academic research for years, aiming to bypass kernel overhead without modifying legacy applications. Prior work, however, largely emphasizes performance under idealized settings and provides limited discussion of how costs and gains manifest in real production environments. Over the past four years, we have deployed and evaluated SMC-R within Alibaba Cloud to accelerate general cloud workloads. Our experience reveals that transparent TCP replacement is far from "drop-in" in practice. The integration barriers and disruptions to the existing ecosystem incur substantial hidden costs. Furthermore, in many real-world scenarios, the Linux TCP stack is not the dominant performance bottleneck; instead, suboptimal application-layer behaviors and system configurations often exert a more decisive influence on end-to-end gains. These engineering realities explain why transparent TCP replacement remains active in academia but sees limited adoption in production. This paper systematically summarizes the fundamental hurdles we encountered and traces them to their root causes, aiming to provide the community with a more grounded perspective on the costs and benefits of transparent acceleration.
- 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.
- Top Cited PapersOpen Access
- 20 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 35 (10) , 1-25
Vul-RAG: Enhancing LLM-based Vulnerability Detection via Knowledge-level RAG
Although LLMs have shown promising potential in vulnerability detection, this study reveals their limitations in distinguishing between vulnerable and similar-but-benign patched code (only 0.06 - 0.14 accuracy). It shows that LLMs struggle to capture the root causes of vulnerabilities during vulnerability detection. To address this challenge, we propose enhancing LLMs with multi-dimensional vulnerability knowledge distilled from historical vulnerabilities and fixes. We design a novel knowledge-level Retrieval-Augmented Generation framework Vul-RAG, which improves LLMs with an accuracy increase of 16% - 24% in identifying vulnerable and patched code. Additionally, vulnerability knowledge generated by Vul-RAG can further (1) serve as high-quality explanations to improve manual detection accuracy (from 60% to 77%), and (2) detect 10 previously-unknown bugs in the recent Linux kernel release with 6 assigned CVEs.
- 20 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 35 (10) , 1-25
Top Cited PapersOpen AccessVul-RAG: Enhancing LLM-based Vulnerability Detection via Knowledge-level RAG
Although LLMs have shown promising potential in vulnerability detection, this study reveals their limitations in distinguishing between vulnerable and similar-but-benign patched code (only 0.06 - 0.14 accuracy). It shows that LLMs struggle to capture the root causes of vulnerabilities during vulnerability detection. To address this challenge, we propose enhancing LLMs with multi-dimensional vulnerability knowledge distilled from historical vulnerabilities and fixes. We design a novel knowledge-level Retrieval-Augmented Generation framework Vul-RAG, which improves LLMs with an accuracy increase of 16% - 24% in identifying vulnerable and patched code. Additionally, vulnerability knowledge generated by Vul-RAG can further (1) serve as high-quality explanations to improve manual detection accuracy (from 60% to 77%), and (2) detect 10 previously-unknown bugs in the recent Linux kernel release with 6 assigned CVEs.
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 3973-3986
LogLabeler: Towards Effective Acquisition of Log Labels in Industrial Log-Based Analysis
Log-based AIOps is a widely researched topic aiming at reducing the developer burden in system maintenance. Since industrial developers prefer lightweight supervised solutions for log-based AIOps, the strong dependence of these solutions on labeled data creates significant challenges for teams new to building log-based AIOps capabilities, such as high labeling costs, inconsistent annotations, and manual management issues. Log-labeling faces challenges in integrating existing artifacts to reduce labeling costs and manage labels effectively. To the best of our knowledge, no prior research addresses of assisting log-labeling problem. In this article, we propose a new approach called LogLabeler to assist developers in annotating and managing log labels. LogLabeler leverages existing artifacts for initial-label-acquisition, minimizes labeling costs by automatically generating all log labels, and shields developers from manual label management through a human-in-the-loop refinement approach. Evaluations on real-world datasets from Alibaba and open-source datasets show that LogLabeler can effectively supplement log labels, achieving comparable accuracy to existing baselines while operating more efficiently. Furthermore, we demonstrate LogLabeler's practical effectiveness at Alibaba through a case study, highlighting its benefits to developers.
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (6) , 3973-3986
LogLabeler: Towards Effective Acquisition of Log Labels in Industrial Log-Based Analysis
Log-based AIOps is a widely researched topic aiming at reducing the developer burden in system maintenance. Since industrial developers prefer lightweight supervised solutions for log-based AIOps, the strong dependence of these solutions on labeled data creates significant challenges for teams new to building log-based AIOps capabilities, such as high labeling costs, inconsistent annotations, and manual management issues. Log-labeling faces challenges in integrating existing artifacts to reduce labeling costs and manage labels effectively. To the best of our knowledge, no prior research addresses of assisting log-labeling problem. In this article, we propose a new approach called LogLabeler to assist developers in annotating and managing log labels. LogLabeler leverages existing artifacts for initial-label-acquisition, minimizes labeling costs by automatically generating all log labels, and shields developers from manual label management through a human-in-the-loop refinement approach. Evaluations on real-world datasets from Alibaba and open-source datasets show that LogLabeler can effectively supplement log labels, achieving comparable accuracy to existing baselines while operating more efficiently. Furthermore, we demonstrate LogLabeler's practical effectiveness at Alibaba through a case study, highlighting its benefits to developers.
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 421-437
TrEnv: 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, 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.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 421-437
Open AccessTrEnv: 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, 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.
- 27 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (4) , 3499-3514
Zero+: Monitoring Large-Scale Cloud-Native Infrastructure Using One-Sided RDMA
Cloud services have shifted from monolithic designs to microservices running on cloud-native infrastructure with monitoring systems to ensure service level agreements (SLAs). However, traditional monitoring systems no longer meet the demands of cloud-native monitoring. In Alibaba’s “double eleven” shopping festival, it is observed that the monitor occupies resources of the monitored infrastructure and even disrupts services. In this paper, we propose a novel monitoring system named for cloud-native monitoring. achieves zero overhead in collecting raw metrics using one-sided remote direct memory access (RDMA) and remedies network congestion by adopting a receiver-driven flow control scheme. also features a priority queue mechanism to meet different quality of service requirements and an efficient batch processing design to relieve CPU occupation. has been deployed and evaluated in four different clusters with heterogeneous RDMA NIC devices and architectures in Alibaba Cloud. Results show that achieves no CPU occupation at the monitored host and supports $1\sim10k$ hosts with $0.1\sim1s$ sampling interval using a single thread for network I/O. significantly relieves the incast issue and maintains $80\sim95\%$ of bandwidth utilization in several clusters when monitoring $1k$ hosts. also ensures services with high priority accomplish collecting metrics earlier than low priority ones by at least $400 \mu s$ when monitoring $1k$ hosts.
- 27 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (4) , 3499-3514
Zero+: Monitoring Large-Scale Cloud-Native Infrastructure Using One-Sided RDMA
Cloud services have shifted from monolithic designs to microservices running on cloud-native infrastructure with monitoring systems to ensure service level agreements (SLAs). However, traditional monitoring systems no longer meet the demands of cloud-native monitoring. In Alibaba’s “double eleven” shopping festival, it is observed that the monitor occupies resources of the monitored infrastructure and even disrupts services. In this paper, we propose a novel monitoring system named for cloud-native monitoring. achieves zero overhead in collecting raw metrics using one-sided remote direct memory access (RDMA) and remedies network congestion by adopting a receiver-driven flow control scheme. also features a priority queue mechanism to meet different quality of service requirements and an efficient batch processing design to relieve CPU occupation. has been deployed and evaluated in four different clusters with heterogeneous RDMA NIC devices and architectures in Alibaba Cloud. Results show that achieves no CPU occupation at the monitored host and supports $1\sim10k$ hosts with $0.1\sim1s$ sampling interval using a single thread for network I/O. significantly relieves the incast issue and maintains $80\sim95\%$ of bandwidth utilization in several clusters when monitoring $1k$ hosts. also ensures services with high priority accomplish collecting metrics earlier than low priority ones by at least $400 \mu s$ when monitoring $1k$ hosts.
- Open Access
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 658-674
Partial Failure Resilient Memory Management System for (CXL-based) Distributed Shared Memory
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 658-674
Open AccessPartial Failure Resilient Memory Management System for (CXL-based) Distributed Shared Memory