Yanan Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yanan Yang has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Laiping Zhao
Tianjin University
6 shared publications - Jie Wu
Cloud Computing Research Institute, China Telecom
5 shared publications - Keqiu Li
Tianjin University
3 shared publications - Meiqi Zhu
China Telecom Cloud Technology Co., Ltd., Beijing, China
3 shared publications - Yiming Li
Tianjin University
3 shared publications - Yujun Wang
China Telecom Cloud Technology Co., Ltd., Beijing, China
3 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (12) , 4277-4291
Exploring SLO-Aware GPU Function Overselling in Multi-Tenant FaaS Platforms
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (12) , 4277-4291
Exploring SLO-Aware GPU Function Overselling in Multi-Tenant FaaS Platforms
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1243-1258
Efficient Strict Serializability for Stateful Serverless Workflows via Workflow Reconciliation
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1243-1258
Open AccessEfficient Strict Serializability for Stateful Serverless Workflows via Workflow Reconciliation
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 838-859
gShare: Efficient GPU Sharing with Aggressive Scheduling in Multi-tenant FaaS platform
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 838-859
Open AccessgShare: Efficient GPU Sharing with Aggressive Scheduling in Multi-tenant FaaS platform
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 817-831
Improving the Serverless Function Cache Efficiency With Flame
Function caching is one of the fundamental techniques in FaaS platforms to alleviate coldstart overhead. However, as cache instances consume significant cloud resources (e.g., memory), it is challenging to balance function performance and cache cost. Current systems use simple and rudderless cache polices with a “local cache control” design, which ignores function characteristics such as workload skewness from hot functions and results in either cache contentions or cache resource waste. In this paper, inspired by software-defined networks, we propose Flame, an efficient cache system to manage cached functions with hotspot-aware instance scheduling and cache allocation. It consists of a two-layer design. Firstly, by decoupling the cache control plane from worker nodes and introducing a centralized cache controller, Flame can schedule functions from a global view of the cluster’s status, thereby reducing inter-node workload skew. Second, Flame divides the prior monolithic cache pool within each node into multiple partitions and dynamically assigns them to different hot functions, thereby further mitigating intra-node cache contention. Experimental results from real-world workloads show that Flame can reduce cache resource usage by 36% on average while improving function performance by nearly 7$\boldsymbol{\times}$ compared to the state-of-the-art method.- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 817-831
Improving the Serverless Function Cache Efficiency With Flame
Function caching is one of the fundamental techniques in FaaS platforms to alleviate coldstart overhead. However, as cache instances consume significant cloud resources (e.g., memory), it is challenging to balance function performance and cache cost. Current systems use simple and rudderless cache polices with a “local cache control” design, which ignores function characteristics such as workload skewness from hot functions and results in either cache contentions or cache resource waste. In this paper, inspired by software-defined networks, we propose Flame, an efficient cache system to manage cached functions with hotspot-aware instance scheduling and cache allocation. It consists of a two-layer design. Firstly, by decoupling the cache control plane from worker nodes and introducing a centralized cache controller, Flame can schedule functions from a global view of the cluster’s status, thereby reducing inter-node workload skew. Second, Flame divides the prior monolithic cache pool within each node into multiple partitions and dynamically assigns them to different hot functions, thereby further mitigating intra-node cache contention. Experimental results from real-world workloads show that Flame can reduce cache resource usage by 36% on average while improving function performance by nearly 7$\boldsymbol{\times}$ compared to the state-of-the-art method.- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 149-162
M etis : A Non-Clairvoyant, Workflow-Aware OS Scheduler for Serverless Applications
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 149-162
Open AccessM etis : A Non-Clairvoyant, Workflow-Aware OS Scheduler for Serverless Applications
- Open Access
- 13 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 42 (1-2) , 1-37
Component-distinguishable Co-location and Resource Reclamation for High-throughput Computing
Cloud service providers improve resource utilization by co-locating latency-critical (LC) workloads with best-effort batch (BE) jobs in datacenters. However, they usually treat multi-component LCs as monolithic applications and treat BEs as “second-class citizens” when allocating resources to them. Neglecting the inconsistent interference tolerance abilities of LC components and the inconsistent preemption loss of BE workloads can result in missed co-location opportunities for higher throughput. We present Rhythm , a co-location controller that deploys workloads and reclaims resources rhythmically for maximizing the system throughput while guaranteeing LC service’s tail latency requirement. The key idea is to differentiate the BE throughput launched with each LC component, that is, components with higher interference tolerance can be deployed together with more BE jobs. It also assigns different reclamation priority values to BEs by evaluating their preemption losses into a multi-level reclamation queue. We implement and evaluate Rhythm using workloads in the form of containerized processes and microservices. Experimental results show that it can improve the system throughput by 47.3%, CPU utilization by 38.6%, and memory bandwidth utilization by 45.4% while guaranteeing the tail latency requirement.
- 13 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 42 (1-2) , 1-37
Open AccessComponent-distinguishable Co-location and Resource Reclamation for High-throughput Computing
Cloud service providers improve resource utilization by co-locating latency-critical (LC) workloads with best-effort batch (BE) jobs in datacenters. However, they usually treat multi-component LCs as monolithic applications and treat BEs as “second-class citizens” when allocating resources to them. Neglecting the inconsistent interference tolerance abilities of LC components and the inconsistent preemption loss of BE workloads can result in missed co-location opportunities for higher throughput. We present Rhythm , a co-location controller that deploys workloads and reclaims resources rhythmically for maximizing the system throughput while guaranteeing LC service’s tail latency requirement. The key idea is to differentiate the BE throughput launched with each LC component, that is, components with higher interference tolerance can be deployed together with more BE jobs. It also assigns different reclamation priority values to BEs by evaluating their preemption losses into a multi-level reclamation queue. We implement and evaluate Rhythm using workloads in the form of containerized processes and microservices. Experimental results show that it can improve the system throughput by 47.3%, CPU utilization by 38.6%, and memory bandwidth utilization by 45.4% while guaranteeing the tail latency requirement.
- Open Access
- 11 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Rethinking Deployment for Serverless Functions: A Performance-First Perspective
Serverless computing commonly adopts strong isolation mechanisms for deploying functions, which may bring significant performance overhead because each function needs to run in a completely new environment (i.e., the "one-to-one" model). To accelerate the function computation, prior work has proposed using sandbox sharing to reduce the overhead, i.e., the "many-to-one" model. Nonetheless, either process-based true parallelism or thread-based pseudo-parallelism still causes high latency, preventing its adaptation for latency-sensitive web services. To achieve optimal performance and resource efficiency for serverless workflow, we argue an "m-to-n" deployment model that manipulates multiple granularities of computing abstractions such as processes, threads, and sandboxes to amortize overhead. We propose wrap, a new deployment abstraction that balances the tradeoffs between interaction overhead, startup overhead and function execution. We further design Chiron, a wrap-based deployment manager that can automatically perform the orchestration of multiple computing abstractions based on performance prioritization. Our comprehensive evaluation indicates that Chiron outperforms state-of-the-art systems by 1.3×-21.8× on system throughput.
- 11 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Open AccessRethinking Deployment for Serverless Functions: A Performance-First Perspective
Serverless computing commonly adopts strong isolation mechanisms for deploying functions, which may bring significant performance overhead because each function needs to run in a completely new environment (i.e., the "one-to-one" model). To accelerate the function computation, prior work has proposed using sandbox sharing to reduce the overhead, i.e., the "many-to-one" model. Nonetheless, either process-based true parallelism or thread-based pseudo-parallelism still causes high latency, preventing its adaptation for latency-sensitive web services. To achieve optimal performance and resource efficiency for serverless workflow, we argue an "m-to-n" deployment model that manipulates multiple granularities of computing abstractions such as processes, threads, and sandboxes to amortize overhead. We propose wrap, a new deployment abstraction that balances the tradeoffs between interaction overhead, startup overhead and function execution. We further design Chiron, a wrap-based deployment manager that can automatically perform the orchestration of multiple computing abstractions based on performance prioritization. Our comprehensive evaluation indicates that Chiron outperforms state-of-the-art systems by 1.3×-21.8× on system throughput.
- Open Access
- 25 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 153-168
Flame: A Centralized Cache Controller for Serverless Computing
Caching function is a promising way to mitigate coldstart overhead in serverless computing. However, as caching also increases the resource cost significantly, how to make caching decisions is still challenging. We find that the prior "local cache control" designs are insufficient to achieve high cache efficiency due to the workload skewness across servers. In this paper, inspired by the idea of software defined network management, we propose Flame, an efficient cache system to manage cached functions with a "centralized cache control" design. By decoupling the cache control plane from local servers and setting up a separate centralized controller, Flame is able to make caching decisions considering a global view of cluster status, enabling the optimized cache-hit ratio and resource efficiency. We evaluate Flame with real-world workloads and the evaluation results show that it can reduce the cache resource usage by 36% on average while improving the coldstart ratio by nearly 7x than the state-of-the-art method.
- 25 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 153-168
Open AccessFlame: A Centralized Cache Controller for Serverless Computing
Caching function is a promising way to mitigate coldstart overhead in serverless computing. However, as caching also increases the resource cost significantly, how to make caching decisions is still challenging. We find that the prior "local cache control" designs are insufficient to achieve high cache efficiency due to the workload skewness across servers. In this paper, inspired by the idea of software defined network management, we propose Flame, an efficient cache system to manage cached functions with a "centralized cache control" design. By decoupling the cache control plane from local servers and setting up a separate centralized controller, Flame is able to make caching decisions considering a global view of cluster status, enabling the optimized cache-hit ratio and resource efficiency. We evaluate Flame with real-world workloads and the evaluation results show that it can reduce the cache resource usage by 36% on average while improving the coldstart ratio by nearly 7x than the state-of-the-art method.
- Top Cited PapersOpen Access
- 22 February 2022
- Published by Association for Computing Machinery (ACM)
- p. 768-781
INFless: a native serverless system for low-latency, high-throughput inference
Modern websites increasingly rely on machine learning (ML) to improve their business efficiency. Developing and maintaining ML services incurs high costs for developers. Although serverless systems are a promising solution to reduce costs, we find that the current general purpose serverless systems cannot meet the low latency, high throughput demands of ML services. While simply ”patching” general serverless systems does not resolve the problem completely, we propose that such a system should natively combine the features of inference with a serverless paradigm. We present INFless, the first ML domain-specific serverless platform. It provides a unified, heterogeneous resource abstraction between CPU and accelerators, and achieves high throughput using built-in batching and non-uniform scaling mechanisms. It also supports low latency through coordinated management of batch queuing time, execution time and coldstart rate. We evaluate INFless using both a local cluster testbed and a large-scale simulation. Experimental results show that INFless outperforms state-of-the-art systems by 2×-5× on system throughput, meeting the latency goals of ML services.
- 22 February 2022
- Published by Association for Computing Machinery (ACM)
- p. 768-781
Top Cited PapersOpen AccessINFless: a native serverless system for low-latency, high-throughput inference
Modern websites increasingly rely on machine learning (ML) to improve their business efficiency. Developing and maintaining ML services incurs high costs for developers. Although serverless systems are a promising solution to reduce costs, we find that the current general purpose serverless systems cannot meet the low latency, high throughput demands of ML services. While simply ”patching” general serverless systems does not resolve the problem completely, we propose that such a system should natively combine the features of inference with a serverless paradigm. We present INFless, the first ML domain-specific serverless platform. It provides a unified, heterogeneous resource abstraction between CPU and accelerators, and achieves high throughput using built-in batching and non-uniform scaling mechanisms. It also supports low latency through coordinated management of batch queuing time, execution time and coldstart rate. We evaluate INFless using both a local cluster testbed and a large-scale simulation. Experimental results show that INFless outperforms state-of-the-art systems by 2×-5× on system throughput, meeting the latency goals of ML services.
- Open Access
- 1 January 2022
- Published by American Association for the Advancement of Science (AAAS) in Intelligent Computing
- Vol. 2022
SDCBench: A Benchmark Suite for Workload Colocation and Evaluation in Datacenters
Colocating workloads are commonly used in datacenters to improve server utilization. However, the unpredictable application performance degradation caused by the contention for shared resources makes the problem difficult and limits the efficiency of this approach. This problem has sparked research in hardware and software techniques that focus on enhancing the datacenters’ isolation abilities. There is still lack of a comprehensive benchmark suite to evaluate such techniques. To address this problem, we present SDCBench, a new benchmark suite that is specifically designed for workload colocation and characterization in datacenters. SDCBench includes 16 applications that span a wide range of cloud scenarios, which are carefully selected from the existing benchmarks using the clustering analysis method. SDCBench implements a robust statistical methodology to support workload colocation and proposes a concept of latency entropy for measuring the isolation ability of cloud systems. It enables cloud tenants to understand the performance isolation ability in datacenters and choose their best-fitted cloud services. For cloud providers, it also helps them to improve the quality of service to increase their revenues. Experimental results show that SDCBench can simulate different workload colocation scenarios by generating pressures on multidimensional resources with simple configurations. We also use SDCBench to compare the latency entropies in public cloud platforms such as Huawei Cloud and AWS Cloud and a local prototype system FlameCluster-II; the evaluation results show FlameCluster-II has the best performance isolation ability over these three cloud systems, with 0.99 of experience availability and 0.29 of latency entropy.
- 1 January 2022
- Published by American Association for the Advancement of Science (AAAS) in Intelligent Computing
- Vol. 2022
Open AccessSDCBench: A Benchmark Suite for Workload Colocation and Evaluation in Datacenters
Colocating workloads are commonly used in datacenters to improve server utilization. However, the unpredictable application performance degradation caused by the contention for shared resources makes the problem difficult and limits the efficiency of this approach. This problem has sparked research in hardware and software techniques that focus on enhancing the datacenters’ isolation abilities. There is still lack of a comprehensive benchmark suite to evaluate such techniques. To address this problem, we present SDCBench, a new benchmark suite that is specifically designed for workload colocation and characterization in datacenters. SDCBench includes 16 applications that span a wide range of cloud scenarios, which are carefully selected from the existing benchmarks using the clustering analysis method. SDCBench implements a robust statistical methodology to support workload colocation and proposes a concept of latency entropy for measuring the isolation ability of cloud systems. It enables cloud tenants to understand the performance isolation ability in datacenters and choose their best-fitted cloud services. For cloud providers, it also helps them to improve the quality of service to increase their revenues. Experimental results show that SDCBench can simulate different workload colocation scenarios by generating pressures on multidimensional resources with simple configurations. We also use SDCBench to compare the latency entropies in public cloud platforms such as Huawei Cloud and AWS Cloud and a local prototype system FlameCluster-II; the evaluation results show FlameCluster-II has the best performance isolation ability over these three cloud systems, with 0.99 of experience availability and 0.29 of latency entropy.