Yuxuan Liu
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
Research Subjects
Yuxuan Liu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Binyu Zang
Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Chenggang Zhao
Tsinghua University, Beijing, China
1 shared publication - Chengqi Deng
DeepSeek-AI, Beijing, China
1 shared publication - Chong Ruan
DeepSeek-AI, Beijing, China
1 shared publication - Damai Dai
DeepSeek-AI, Beijing, China
1 shared publication - Haibo Chen
Shanghai Jiao Tong University, Shanghai, China
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1731-1745
Insights into DeepSeek-V3: Scaling Challenges and Reflections on Hardware for AI Architectures
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1731-1745
Top Cited PapersOpen AccessInsights into DeepSeek-V3: Scaling Challenges and Reflections on Hardware for AI Architectures
- Open Access
- 25 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 43-56
CPS: A Cooperative Para-virtualized Scheduling Framework for Manycore Machines
Today's cloud platforms offer large virtual machine (VM) instances with multiple virtual CPUs (vCPU) on manycore machines. These machines typically have a deep memory hierarchy to enhance communication between cores. Although previous researches have primarily focused on addressing the performance scalability issues caused by the double scheduling problem in virtualized environments, they mainly concentrated on solving the preemption problem of synchronization primitives and the traditional NUMA architecture. This paper specifically targets a new aspect of scalability issues caused by the absence of runtime hypervisor-internal states (RHS). We demonstrate two typical RHS problems, namely the invisible pCPU (physical CPU) load and dynamic cache group mapping. These RHS problems result in a collapse in VM performance and low CPU utilization because the guest VM lacks visibility into the latest runtime internal states maintained by the hypervisor, such as pCPU load and vCPU-pCPU mappings. Consequently, the guest VM makes inefficient scheduling decisions. To address the RHS issue, we argue that the solution lies in exposing the latest scheduling decisions made by both the guest and host schedulers to each other. Hence, we present a cooperative para-virtualized scheduling framework called CPS, which facilitates the proactive exchange of timely scheduling information between the hypervisor and guest VMs. To ensure effective scheduling decisions for VMs, a series of techniques are proposed based on the exchanged information. We have implemented CPS in Linux KVM and have designed corresponding solutions to tackle the two RHS problems. Evaluation results demonstrate that CPS significantly improves the performance of PARSEC by 81.1% and FxMark by 1.01x on average for the two identified problems.
- 25 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 43-56
Open AccessCPS: A Cooperative Para-virtualized Scheduling Framework for Manycore Machines
Today's cloud platforms offer large virtual machine (VM) instances with multiple virtual CPUs (vCPU) on manycore machines. These machines typically have a deep memory hierarchy to enhance communication between cores. Although previous researches have primarily focused on addressing the performance scalability issues caused by the double scheduling problem in virtualized environments, they mainly concentrated on solving the preemption problem of synchronization primitives and the traditional NUMA architecture. This paper specifically targets a new aspect of scalability issues caused by the absence of runtime hypervisor-internal states (RHS). We demonstrate two typical RHS problems, namely the invisible pCPU (physical CPU) load and dynamic cache group mapping. These RHS problems result in a collapse in VM performance and low CPU utilization because the guest VM lacks visibility into the latest runtime internal states maintained by the hypervisor, such as pCPU load and vCPU-pCPU mappings. Consequently, the guest VM makes inefficient scheduling decisions. To address the RHS issue, we argue that the solution lies in exposing the latest scheduling decisions made by both the guest and host schedulers to each other. Hence, we present a cooperative para-virtualized scheduling framework called CPS, which facilitates the proactive exchange of timely scheduling information between the hypervisor and guest VMs. To ensure effective scheduling decisions for VMs, a series of techniques are proposed based on the exchanged information. We have implemented CPS in Linux KVM and have designed corresponding solutions to tackle the two RHS problems. Evaluation results demonstrate that CPS significantly improves the performance of PARSEC by 81.1% and FxMark by 1.01x on average for the two identified problems.