Demo Data from EDBT 2026 / reviewers in the wild / expert
Bin Liang 0005
dblp:71/6053-5
· DBLP profile ↗
9ranked-venue papers
9as first author
7since 2021 · last 2026
0000-0003-2297-0844ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 4 first-author · 2 since 2021Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021
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 · 56% Distributed systems · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing
cluster resource management and scheduling |
1.0 | 1 | 2026 | A Rescheduling Mechanism for Cloud Data Centers Leveraging Dynamic Fault-Tolerant Classification · IEEE Trans. Parallel Distributed Syst. 2026 |
Distributed systems
fault tolerance |
1.0 | 1 | 2026 | A Rescheduling Mechanism for Cloud Data Centers Leveraging Dynamic Fault-Tolerant Classification · IEEE Trans. Parallel Distributed Syst. 2026 |
Cloud and datacenter computing › cloud service management
service level agreement |
0.3 | 1 | 2026 | A Rescheduling Mechanism for Cloud Data Centers Leveraging Dynamic Fault-Tolerant Classification · IEEE Trans. Parallel Distributed Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
dynamic fault-tolerant classification · 1.0RMDFC · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Rescheduling Mechanism for Cloud Data Centers Leveraging Dynamic Fault-Tolerant ClassificationabstractThe proliferation of cloud computing has prompted leading technology providers to establish extensive cloud data center (CDC) infrastructures. Balancing service quality and profitability is a crucial goal due to the intense competition brought about by constantly upgrading user demands. As a result, suppliers are increasingly relying on complex fault-tolerant mechanisms to ensure the reliability of CDC. The traditional rescheduling method is a commonly used approach. However, this often leads to longer completion times or increased compensation, thereby damaging reputation. We investigates operational inefficiencies attributable to virtual machine (VM) failures and failed cloud task (FCT) rescheduling in CDC. Our contribution includes three aspects. First, we present a dynamic classification rule of FCT according to the attribute for the FCT. Second, building upon this rule, we propose a rescheduling mechanism for CDC leveraging dynamic fault-tolerant classification (RMDFC) algorithm to concurrently enhance failure repair rate and minimize compensation overhead. Finally, perform performance tests on the RMDFC algorithm. The failure repair rate of RMDFC algorithm has increased by an average of 3.8 times compared to the comparative algorithms. At the same time, compensation decreased by an average of 58% and profit increased by an average of 9% for cloud service providers in CDCs. The test results show that the RMDFC algorithm exhibits excellent performance. Bin Liang 0005 |
IEEE Trans. Parallel Distributed Syst. | 1 |
| 2025 | Memory Priority Scheduling Algorithm for Cloud Data Center Based on Machine Learning Dynamic Clustering AlgorithmabstractAs the cloud data center (CDC) landscape continues to broaden, CDC resource utilization as the benchmark for assessing scheduling methodologies. Concurrently enhancing both CPU and memory utilization stands as a paramount priority. However, prevalent algorithms tend to solely prioritize CPU utilization while neglecting memory efficiency, ultimately escalating energy expenditure. This article initiates by conducting a comprehensive examination of memory utilization repercussions on CDCs. Subsequently, it facilitates the dynamic clustering of physical machines and virtual machine deployments, ensuring a balanced utilization profile. Furthermore, it introduces the memory priority scheduling algorithm for CDC based on machine learning dynamic clustering algorithm (PMPD). Comparative evaluations against other algorithms underscore the prowess of PMPD in concurrently optimizing CPU and memory utilization, thereby minimizing the number of active PMs and diminishing energy consumption of CDCs. Bin Liang 0005 |
IEEE Trans. Ind. Informatics | 1 |
| 2024 | Low-Energy Resource Classification Algorithm for Cross-Regional Cloud Data Centers Based on K-Means Clustering AlgorithmabstractAs the division of labor in the industry becomes more refined, an increasing number of companies are abandoning infrastructure construction and instead moving their operations to cloud data centers (CBDCs). Cloud service providers are responding to the surge in demand by deploying their own CBDCs worldwide. However, the energy consumption and operation costs of these CBDCs vary depending on the region's environment and policies. To mitigate these costs, cloud service providers often employ resource management algorithms. This article conducts a comprehensive analysis of the cross-regional CBDC model, including establishing virtual machine classification rules based on clustering results. Ultimately, this article proposes a low-energy resource classification algorithm for cross-regional CBDCs based on the K-means clustering algorithm (LCKC). The effectiveness of the LCKC algorithm is compared to that of other algorithms, and the results indicate that it reduces energy consumption in cross-regional CBDCs. Bin Liang 0005, Junqing Bai |
IEEE Trans. Ind. Informatics | 1 |
| 2023 | Cloud service provisioning strategy using data center consortium clusteringabstractThe rapid growth of data centers provides cloud users with better choices and services. An increasing number of companies are involved in the construction of data centers ; at the same time, the original cloud service providers are constantly expanding new data centers to meet the needs of users. Therefore, the joint scheduling of multiple data centers has become a difficult problem that cloud service providers must face. Joint scheduling refers to the resource allocation among multiple data centers of a cloud service provider. That is, how can the virtual machine application of cloud users be deployed on the physical machine in multiple data centers. A single data center provisioning strategy can solve the scheduling problem within the data center. However, multiple data centers can make the previous provisioning strategy invalid due to geographical location and other differences. In this paper, the characteristics of different data centers are analyzed and clustered to form a data center consortium. Then, the virtual machine (VM) is classified according to the deadline. As cloud users purchase virtual machine resources from cloud service providers, they are billed by time in most cases. The deadline of the virtual machine refers to the time when the virtual machine ends its service. Then, we analyze the power consumption of the data center and deploy VMs based on the rule of avoiding hotspot deployment of VMs with priority energy consumption. Finally, a cloud service provisioning strategy using data center consortium clustering (PSDC3) is proposed and verified. It can be seen from the results that the algorithm can significantly reduce the number of hotspots and energy consumption of cloud data centers. Bin Liang 0005 |
Expert Syst. Appl. | 1 |
| 2022 | A high-applicability heterogeneous cloud data centers resource management algorithm based on trusted virtual machine migration
Bin Liang 0005, Xiaoshe Dong, Yufei Wang 0008, Xingjun Zhang |
Expert Syst. Appl. | 1 |
| 2021 | An energy-aware resource deployment algorithm for cloud data centers based on dynamic hybrid machine learning
Bin Liang 0005, Yuanqi Su |
Knowl. Based Syst. | 1 |
| 2021 | A multi-dimensional double descending maximum padding priority algorithm for cloud data centers
Bin Liang 0005, Xiaoshe Dong, Yufei Wang 0008 |
J. Supercomput. | 1 |
| 2020 | Memory-aware resource management algorithm for low-energy cloud data centers
Bin Liang 0005, Xiaoshe Dong, Yufei Wang 0008, Xingjun Zhang |
Future Gener. Comput. Syst. | 1 |
| 2020 | A low-power task scheduling algorithm for heterogeneous cloud computing
Bin Liang 0005, Xiaoshe Dong, Yufei Wang 0008, Xingjun Zhang |
J. Supercomput. | 1 |