Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhongshan Liu
dblp:235/6135
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0003-0597-5176ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1
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 |
Cloud and datacenter computing · 83% Energy-efficient computing · 17% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management |
0.4 | 1 | 2019 | Cost-Efficient Consolidating Service for Aliyun's Cloud-Scale Computing · IEEE Trans. Serv. Comput. 2019 |
Cloud and datacenter computing › virtualization › virtual machine management
server consolidation |
0.4 | 1 | 2019 | Cost-Efficient Consolidating Service for Aliyun's Cloud-Scale Computing · IEEE Trans. Serv. Comput. 2019 |
Cloud and datacenter computing › virtualization
virtual machine migration |
0.4 | 1 | 2019 | Cost-Efficient Consolidating Service for Aliyun's Cloud-Scale Computing · IEEE Trans. Serv. Comput. 2019 |
Energy-efficient computing
datacenter energy efficiency |
0.1 | 1 | 2019 | Cost-Efficient Consolidating Service for Aliyun's Cloud-Scale Computing · IEEE Trans. Serv. Comput. 2019 |
Energy-efficient computing
power management |
0.1 | 1 | 2019 | Cost-Efficient Consolidating Service for Aliyun's Cloud-Scale Computing · IEEE Trans. Serv. Comput. 2019 |
Methods — techniques the papers use, named apart from their topics
worst-fit heuristic · 0.4migration cost model · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Enhanced Self-supervised Graph Learning Algorithm for Social RecommendationabstractGraph neural networks (GNNs) have achieved success in social recommender systems due to its capacity of capturing high-order collaborative filtering effects. However, some issues, such as vector scale distortion and over-smoothing, are obstacles to improving the performance of GNN-based models. This paper investigates these two issues and proposes an enhanced self-supervised graph learning (ESGL) algorithm based on GNN for social recommendation. By introducing a scale regulation module, ESGL can solve the issue of vector scale distortion. The scale regulation module takes the output of GNN as its input and generates the scaling matrix that limits the scale of embeddings. In addition, ESGL adopts two kinds of self-supervised learning schemes to enhance the recommendation performance. One scheme is to learn the similarity between users, while the other scheme is the embedding-level contrastive learning. The latter regards the initial normalized embedding of a user node and its average normalized embedding generated in the rest layers as positive samples. Experimental results have shown that our model is effective in improving recommendations. Zhongshan Liu, Li Zhang 0004 |
IJCNN | 1 |
| 2019 | Cost-Efficient Consolidating Service for Aliyun's Cloud-Scale ComputingabstractServer consolidation is critical for energy efficiency of cloud-scale computing. In production environments like Aliyun, which is one of the largest public cloud platforms in the world, server consolidation has several challenges. First, the widespread use of local storage remarkably increases the migration cost (time). Second, the resource utilization of service instances varies over time, which may result in migration oscillation. Third, server consolidation must follow practical constraints. E.g., instances can only be migrated within a maintenance window, and both the resource utilization and the number of instances on a server are bounded. This paper designs and implements C4, a Cost-Efficient Consolidating Service for Aliyun's Cloud-Scale Computing, which Aliyun uses to consolidate servers. We analyze user pattern, resource utilization, and migration cost in Aliyun, showing that traditional utilization-based consolidation approaches cannot meet the needs in production environments, especially for the local-storage-based computing. This motivates us to propose the migration cost model, by which to select servers with the minimum migration time to release. We use the Worst-Fit heuristic to migrate instances to balance the load. Evaluation shows that C4 achieves cost-efficient, load-balanced, and oscillation-free consolidating service. We describe experience with over one year of C4 production deployment, lessons learned, and areas for future work. Huining Yan, Huaimin Wang 0001, Dongsheng Li 0001, Yunyang Zhang, Zhongshan Liu, Wei Cao 0006, Feng Yu 0022 |
IEEE Trans. Serv. Comput. | 8 |