VLDB 2026 Research / reviewers in the wild / expert
Mosong Zhou
dblp:189/1544
· DBLP profile ↗
4ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-2507-9769ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 33% Processor architecture and microarchitecture · 33% Parallel and multicore computing · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › concurrent programming
asynchronous execution |
0.9 | 1 | 2025 | Beehive: A Scalable Disaggregated Memory Runtime Exploiting Asynchrony of Multithreaded Programs · NSDI 2025 |
Memory systems
memory disaggregation |
0.9 | 1 | 2025 | Beehive: A Scalable Disaggregated Memory Runtime Exploiting Asynchrony of Multithreaded Programs · NSDI 2025 |
Processor architecture and microarchitecture › multithreading
multithreaded execution |
0.9 | 1 | 2025 | Beehive: A Scalable Disaggregated Memory Runtime Exploiting Asynchrony of Multithreaded Programs · NSDI 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Beehive: A Scalable Disaggregated Memory Runtime Exploiting Asynchrony of Multithreaded Programs
Quanxi Li, Ying Liu 0055, Yanwen Xia, Jie Zhang 0048, Mosong Zhou, Xiaobing Feng 0002, Huimin Cui, Yizhou Shan, Chenxi Wang 0005 |
NSDI | 6 |
| 2022 | Characterizing and orchestrating VM reservation in geo-distributed clouds to improve the resource efficiencyabstractCloud providers often build a geo-distributed cloud from multiple datacenters in different geographic regions, to serve tenants at different locations. The tenants that run large scale applications often reserve resources based on their peak loads in the region close to the end users to handle the ever changing application load, wasting a large amount of resources. We therefore characterize the VM request patterns of the top tenants in our production public geo-distributed cloud, and open-source the VM request traces in four months from the top 20 tenants of our cloud. The characterization shows that the resource usage of large tenants has various temporal and spatial patterns on the dimensions of time series, regions, and VM types, and has the potential of peak shaving between different tenants to further reduce the resource reservation cost. Based on the findings, we propose a resource reservation and VM request scheduling scheme named ROS to minimize the resource reservation cost while satisfying the VM allocation requests. Our experiments show that ROS reduces the overall deployment cost by 75.4% and the reservation resources by 60.1%, compared to the tenant-specified reservation strategy. Jiuchen Shi, Kaihua Fu, Quan Chen 0002, Changpeng Yang, Mosong Zhou, Jieru Zhao, Chen Chen 0067, Minyi Guo |
SoCC | 6 |
| 2020 | Fine-grained scheduling in multi-resource clusters
Mosong Zhou, Xiaoshe Dong, Heng Chen 0002, Xingjun Zhang |
J. Supercomput. | 1 |
| 2018 | A Runtime Available Resource Capacity Evaluation Model Based on the Concept of Similar TasksabstractA mismatch between resource supply and demand in cloud computing leads to inefficient utilization of resources or performance degradation. Therefore, this paper establishes a runtime model to evaluate the available capacity of computing resources on the basis of similar tasks. This model takes advantage of a characteristic of cloud workload; that is, similar tasks in cloud computing have a similar execution logic. The model evaluates the available resource capacity according to task similarity, thus avoiding any impact on the resource consumption of existing benchmarks. We apply the model to propose a resource capacity evaluation method called Caipan, which considers numerous factors according to resource type. This method obtains accurate results in a timely manner at little cost. We use the results of Caipan to develop some algorithms that aim to match resource supply and demand, and improve cloud platform performance. We test the Caipan method and the Caipan-based algorithms in both dedicated and real-world cloud environments. The test results show that the Caipan method obtains the available resource capacity both accurately and in a timely manner, and effectively supports the optimization of both algorithms and platforms. Moreover, algorithms based on Caipan reduce the mismatch between resource supply and demand, and significantly improve cloud platform performance. Mosong Zhou, Xiaoshe Dong, Heng Chen 0002, Xingjun Zhang |
Comput. J. | 1 |