Guodong Yang

Guodong Yang

Auto-generated profile, based on publicly available information

Guodong Yang

Alibaba Group, Hangzhou, 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
8 May 2023
Verified
Conference Paper
Open access
CLChengzhi Lu
Chengzhi Lu
HXHuanle Xu
Huanle Xu
KYKejiang Ye
Kejiang Ye
GXGuoyao Xu
Guoyao Xu
LZLiping Zhang
Liping Zhang
CXChengzhong Xu
Chengzhong Xu
To fully utilize computing resources, cloud providers such as Google and Alibaba choose to co-locate online services with batch processing applications in their data centers. By implementing unified resource management policies, different types of complex computing jobs request resources in a consistent way, which can help data centers achieve global optimal scheduling and provide computing power with higher quality. To understand this new scheduling paradigm, in this paper, we first present an in-depth study of Alibaba's unified scheduling workloads. Our study focuses on the characterization of resource utilization, the application running performance, and scheduling scalability. We observe that although computing resources are significantly over-committed under unified scheduling, the resource utilization in Alibaba data centers is still low. In addition, existing resource usage predictors tend to make severe overestimations. At the same time, tasks within the same application behave fairly consistently, and the running performance of tasks can be well-profiled with respect to resource contention on the corresponding physical host. Based on these observations, in this paper, we design Optum, a unified data center scheduler for improving the overall resource utilization while ensuring good performance for each application. Optum formulates an optimization problem to schedule unified task requests, aiming to balance the trade-off between utilization and resource contention. Optum also implements efficient heuristics to solve the optimization problem in a scalable manner. Large-scale experiments demonstrate that Optum can save up to 15% of resources without performance degradation compared to state-of-the-art unified scheduling schemes.

13 February 2024 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
SLShutian Luo
Shutian Luo
CLChenyu Lin
Chenyu Lin
KYKejiang Ye
Kejiang Ye
GXGuoyao Xu
Guoyao Xu
LZLiping Zhang
Liping Zhang
CXChengzhong Xu
Chengzhong Xu
A common approach to improving resource utilization in data centers is to adaptively provision resources based on the actual workload. One fundamental challenge of doing this in microservice management frameworks, however, is that different components of a service can exhibit significant differences in their impact on end-to-end performance. To make resource management more challenging, a single microservice can be shared by multiple online services that have diverse workload patterns and SLA requirements. We present an efficient resource management system, namely Erms, for guaranteeing SLAs with high probability in shared microservice environments. Erms profiles microservice latency as a piece-wise linear function of the workload, resource usage, and interference. Based on this profiling, Erms builds resource scaling models to optimally determine latency targets for microservices with complex dependencies. Erms also designs new scheduling policies at shared microservices to further enhance resource efficiency. Experiments across microservice benchmarks as well as trace-driven simulations demonstrate that Erms can reduce SLA violation probability by 5× and more importantly, lead to a reduction in resource usage by 1.6×, compared to state-of-the-art approaches.

30 March 2025
Verified
Conference Paper
Open access
XWXinkai Wang
Xinkai Wang
XHXiaofeng Hou
Xiaofeng Hou
CLChao Li
Chao Li
YLYuancheng Li
Yuancheng Li
DLDu Liu
Du Liu
MGMinyi Guo
Minyi Guo

11 December 2025
Verified
Conference Paper
Open access
JDJiaang Duan
Jiaang Duan
SXShenglin Xu
Shenglin Xu
SQShiyou Qian
Shiyou Qian
DYDingyu Yang
Dingyu Yang
KWKangjin Wang
Kangjin Wang
GCGang Chen
Gang Chen


27 October 2024
Verified
Conference Paper
Open access
HLHaoyu Liao
Haoyu Liao
JGJianmei Guo
Jianmei Guo
BHBo Huang
Bo Huang
YHYujie Han
Yujie Han
DYDingyu Yang
Dingyu Yang
LZLiping Zhang
Liping Zhang
Software deployment misconfiguration often happens and has been one of the major causes of deployment failures that give rise to service interruptions. However, there is currently no existing approach to automatically repairing deployment failures. We propose DeployFix, which automatically repairs software deployment failures via constraint solving in the dynamic-changing deployment environments. DeployFix first defines DeployIR as a unified intermediate representation to achieve the translation of heterogeneous specifications from different schedulers with different syntaxes. By reducing the root-cause analysis of deployment failures to the conflict resolution in propositional logic, DeployFix uses off-the-shelf constraint solvers to achieve automatic localization and diagnosis of conflicting constraints, which are the root causes of deployment failures. DeployFix finally resolves the conflicting constraints and generates repaired deployment configurations in terms of practical requirements. We evaluate DeployFix in both simulation and production environments with tens of thousands of nodes at Alibaba, on which tens of thousands of applications are running guided by hundreds of thousands of deployment constraints. Experimental results demonstrate that DeployFix outperforms the state of the art and it correctly repairs the deployment failures in minutes, even in a large production data center.