Yuxuan Liu

Yuxuan Liu

Auto-generated profile, based on publicly available information

Yuxuan Liu

DeepSeek-AI, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2025
Verified
Conference Paper
Open access
CZChenggang Zhao
Chenggang Zhao
CDChengqi Deng
Chengqi Deng
CRChong Ruan
Chong Ruan
DDDamai Dai
Damai Dai
HGHuazuo Gao
Huazuo Gao
YWY.X. Wei
Y.X. Wei

25 March 2023
Verified
Conference Paper
Open access
YLYuxuan Liu
Yuxuan Liu
TXTianqiang Xu
Tianqiang Xu
ZMZeyu Mi
Zeyu Mi
ZHZhichao Hua
Zhichao Hua
BZBinyu Zang
Binyu Zang
HCHaibo Chen
Haibo Chen
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.