EDBT 2026 Demo / reviewers in the wild / expert
Haosen Shi 0001
dblp:276/9714-1
· DBLP profile ↗
5ranked-venue papers
0as first author
4since 2021 · last 2023
0000-0002-6454-4088ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 4 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | OLPart: Online Learning based Resource Partitioning for Colocating Multiple Latency-Critical Jobs on Commodity ComputersabstractColocating multiple jobs on the same server has been a commonly used approach for improving resource utilization in cloud environments. However, performance interference due to the contention over shared resources makes resource partitioning an important research problem. Partitioning multiple resources coordinately is particularly challenging when multiple latency-critical (LC) jobs are colocated with best-effort (BE) jobs, since the QoS needs to be protected for all the LC jobs. So far, this problem is not well-addressed in the literatures. Ruobing Chen 0002, Haosen Shi 0001, Yusen Li, Xiaoguang Liu 0001, Gang Wang 0001 |
EuroSys | 2 |
| 2023 | Jointly Optimizing Job Assignment and Resource Partitioning for Improving System Throughput in Cloud DatacentersabstractColocating multiple jobs on the same server has been widely applied for improving resource utilization in cloud datacenters. However, the colocated jobs would contend for the shared resources, which could lead to significant performance degradation. An efficient approach for eliminating performance interference is to partition the shared resources among the colocated jobs. However, this makes the resource management in datacenters very challenging. In this paper, we propose JointOPT, the first resource management framework that optimizes job assignment and resource partitioning jointly for improving the throughput of cloud datacenters. JointOPT uses a local search based algorithm to find the near optimal job assignment configuration, and uses a deep reinforcement learning (DRL) based approach to dynamically partition the shared resources among the colocated jobs. In order to reduce the interaction overhead with real systems, it leverages deep learning to estimate job performance without running them on real servers. We conduct extensive experiments to evaluate JointOPT and the results show that JointOPT significantly outperforms the state-of-the-art baselines, with an advantage from 13.3% to 47.7%. Ruobing Chen 0002, Haosen Shi 0001, Jinping Wu, Yusen Li, Xiaoguang Liu 0001, Gang Wang 0001 |
ACM Trans. Archit. Code Optim. | 2 |
| 2022 | GCNPart: Interference-Aware Resource Partitioning Framework with Graph Convolutional Neural Networks and Deep Reinforcement Learning
Ruobing Chen 0002, Haosen Shi 0001, Jinping Wu, Yusen Li, Xiaoguang Liu 0001, Gang Wang 0001 |
ICA3PP | 2 |
| 2021 | DRLPart: A Deep Reinforcement Learning Framework for Optimally Efficient and Robust Resource Partitioning on Commodity ServersabstractWorkload consolidation is a commonly used approach for improving resource utilization of commodity servers. However, colocated workloads often suffer from significant performance degradations due to resource contention, which makes resource partitioning an important research problem. Partitioning multiple resources coordinately is particularly challenging due to the complex contention behaviors and huge solution space, which is not well-addressed in the literature. Ruobing Chen 0002, Jinping Wu, Haosen Shi 0001, Yusen Li, Xiaoguang Liu 0001, Gang Wang 0001 |
HPDC | 3 |
| 2020 | Deep Learning Assisted Resource Partitioning for Improving Performance on Commodity ServersabstractIn this paper, we introduce a deep reinforcement learning (DRL) framework for solving the problem of partitioning LLC and memory bandwidth coordinately in an end-to-end manner. To this end, we formulate the problem as a markov decision process and utilize DRL algorithm to derive the optimal partition. To avoid the extensive cost of training the policy on physical server, we present a model-based solution, where a reward prediction model is leveraged to train the partitioning policy offline. To construct a precise reward prediction model, we introduce a novel representation for the partitioning scheme, where graph convolutional networks (GCN) is employed to represent the LLC partition as a bipartite graph so that those heterogeneous but identical partitions could result in the same representations and thus eases the prediction task. Ruobing Chen 0002, Jinping Wu, Haosen Shi 0001, Yusen Li, Haiyan Yin, Shanjiang Tang, Xiaoguang Liu 0001, Gang Wang 0001 |
PACT | 3 |