Ming Yan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ming Yan has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Jie Wu
Fudan University, Shanghai, China
7 shared publications - Yukai Huang
Fudan University
6 shared publications - Lulu Chen
Fudan University
4 shared publications - Sicheng Liang
Fudan University, Shanghai, China
4 shared publications - Chunpu Huang
Fudan University, Shanghai, China
3 shared publications - Jingqi Feng
Fudan University, Shanghai, China
3 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1132-1142
OrionInfer: Low-Overhead Parallelism Switching and Live Migration for Efficient LLM Serving
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1132-1142
Open AccessOrionInfer: Low-Overhead Parallelism Switching and Live Migration for Efficient LLM Serving
- Open Access
- 26 January 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (3)
LACE: Mitigating cold-starts in serverless with a multi-task mixture-of-experts caching
- 26 January 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (3)
Open AccessLACE: Mitigating cold-starts in serverless with a multi-task mixture-of-experts caching
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1283-1295
WindServe: Efficient Phase-Disaggregated LLM Serving with Stream-based Dynamic Scheduling
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1283-1295
Open AccessWindServe: Efficient Phase-Disaggregated LLM Serving with Stream-based Dynamic Scheduling
- Open Access
- 14 May 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (5) , 218
U-SCAD: An Unsupervised Method of System Call-Driven Anomaly Detection for Containerized Edge Clouds
Container technology is currently one of the mainstream technologies in the field of cloud computing, yet its adoption in resource-constrained, latency-sensitive edge environments introduces unique security challenges. While existing system call-based anomaly-detection methods partially address these issues, they suffer from high false positive rates and excessive computational overhead. To achieve security and observability in edge-native containerized environments and lower the cost of computing resources, we propose an unsupervised anomaly-detection method based on system calls. This method filters out unnecessary system call data through automatic rule generation and an unsupervised classification model. To increase the accuracy of anomaly detection and reduce the false positive rates, this method embeds system calls into sequences using the proposed Syscall2vec and processes the remain sequences in favor of the anomaly detection model’s analysis. We conduct experiments using our method with a background based on modern containerized cloud microservices. The results show that the detection part of our method improves the F1 score by 23.88% and 41.31%, respectively, as compared to HIDS and LSTM-VAE. Moreover, our method can effectively reduce the original processing data to 13%, which means that it significantly lowers the cost of computing resources.
- 14 May 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (5) , 218
Open AccessU-SCAD: An Unsupervised Method of System Call-Driven Anomaly Detection for Containerized Edge Clouds
Container technology is currently one of the mainstream technologies in the field of cloud computing, yet its adoption in resource-constrained, latency-sensitive edge environments introduces unique security challenges. While existing system call-based anomaly-detection methods partially address these issues, they suffer from high false positive rates and excessive computational overhead. To achieve security and observability in edge-native containerized environments and lower the cost of computing resources, we propose an unsupervised anomaly-detection method based on system calls. This method filters out unnecessary system call data through automatic rule generation and an unsupervised classification model. To increase the accuracy of anomaly detection and reduce the false positive rates, this method embeds system calls into sequences using the proposed Syscall2vec and processes the remain sequences in favor of the anomaly detection model’s analysis. We conduct experiments using our method with a background based on modern containerized cloud microservices. The results show that the detection part of our method improves the F1 score by 23.88% and 41.31%, respectively, as compared to HIDS and LSTM-VAE. Moreover, our method can effectively reduce the original processing data to 13%, which means that it significantly lowers the cost of computing resources.
- 15 March 2025
- Published by Elsevier in Computer Networks
- Vol. 263
Offloading distributed key-value stores with off-path SmartNICs
- 15 March 2025
- Published by Elsevier in Computer Networks
- Vol. 263
Offloading distributed key-value stores with off-path SmartNICs
- 20 February 2025
- Published by Springer Nature
- p. 92-103
HR-Tree: A Hybrid PMem-DRAM and Write-Optimized R-Tree for Spatial Data Storage
- 20 February 2025
- Published by Springer Nature
- p. 92-103
HR-Tree: A Hybrid PMem-DRAM and Write-Optimized R-Tree for Spatial Data Storage
- 20 February 2025
- Published by Springer Nature
- p. 381-393
Labor: Adaptive Lazy Compaction for Learned Index in LSM-Tree
- 20 February 2025
- Published by Springer Nature
- p. 381-393
Labor: Adaptive Lazy Compaction for Learned Index in LSM-Tree
- Open Access
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 929-938
Revisiting Learned Index with Byte-addressable Persistent Storage
Byte-addressable Persistent Storage (BPS), such as persistent memory and CXL-enabled SSDs, has become an extension of main memory. This opens up new possibilities for indexes that operate and persist data directly on the memory bus. Recent learned indexes exploit data distribution and have shown great potential for some workloads. Despite some work proposed for integrating learned indexes into BPS, they are mainly based on Intel’s first-generation persistent memory. The current design suffers from the following problems: 1) Excessive storage line accesses due to large node in learned indexes; 2) Inefficient concurrency control due to volatile cache; 3) Write amplification due to mismatch access granularity. To resolve these challenges, we introduce a new learned index named PFLX, featuring three key design improvements: 1) a Storage Line-Friendly Node Layout that enhances search and insertion operations and minimizes storage line accesses through strategic use of pointers; 2) a Persistent Cache-based Lock-free Concurrency Mechanism that utilizes atomic primitives to serialize operations in leaf nodes effectively; 3) a Selective Data Flush Mechanism designed to reduce write amplification. Evaluations show that PFLX outperforms the state-of-the-art persistent indexes by 1.2 ∼ 3 ×.
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 929-938
Open AccessRevisiting Learned Index with Byte-addressable Persistent Storage
Byte-addressable Persistent Storage (BPS), such as persistent memory and CXL-enabled SSDs, has become an extension of main memory. This opens up new possibilities for indexes that operate and persist data directly on the memory bus. Recent learned indexes exploit data distribution and have shown great potential for some workloads. Despite some work proposed for integrating learned indexes into BPS, they are mainly based on Intel’s first-generation persistent memory. The current design suffers from the following problems: 1) Excessive storage line accesses due to large node in learned indexes; 2) Inefficient concurrency control due to volatile cache; 3) Write amplification due to mismatch access granularity. To resolve these challenges, we introduce a new learned index named PFLX, featuring three key design improvements: 1) a Storage Line-Friendly Node Layout that enhances search and insertion operations and minimizes storage line accesses through strategic use of pointers; 2) a Persistent Cache-based Lock-free Concurrency Mechanism that utilizes atomic primitives to serialize operations in leaf nodes effectively; 3) a Selective Data Flush Mechanism designed to reduce write amplification. Evaluations show that PFLX outperforms the state-of-the-art persistent indexes by 1.2 ∼ 3 ×.
- 14 April 2023
- Published by Springer Nature
- p. 46-61
PFtree: Optimizing Persistent Adaptive Radix Tree for PM Systems on eADR Platform
- 14 April 2023
- Published by Springer Nature
- p. 46-61
PFtree: Optimizing Persistent Adaptive Radix Tree for PM Systems on eADR Platform
- 1 July 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 105
HANSEL: Adaptive horizontal scaling of microservices using Bi-LSTM
- 1 July 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 105
HANSEL: Adaptive horizontal scaling of microservices using Bi-LSTM