Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Cheng Hu 0004

dblp:63/7026-4 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
4since 2021 · last 2024
0000-0001-8465-181XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 4 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 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 · 67% Performance modeling and evaluation · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.812024
Towards a Heterogeneous and Elastic Cloud Service System With a Correlation-Based Universal Resource Matching Strategy · IEEE Trans. Serv. Comput. 2024
Cloud and datacenter computing › resource management › resource allocation and scheduling
resource matching
0.812024
Towards a Heterogeneous and Elastic Cloud Service System With a Correlation-Based Universal Resource Matching Strategy · IEEE Trans. Serv. Comput. 2024
Performance modeling and evaluation › capacity planning
resource requirement estimation
0.812024
Towards a Heterogeneous and Elastic Cloud Service System With a Correlation-Based Universal Resource Matching Strategy · IEEE Trans. Serv. Comput. 2024

Methods — techniques the papers use, named apart from their topics

decision tree · 0.8correlation analysis · 0.8
YearPublicationVenuePosition
2024 Towards a Heterogeneous and Elastic Cloud Service System With a Correlation-Based Universal Resource Matching Strategy
abstract
In elastic cloud service systems, it is a challenge to evaluate and match the fluctuating resource demand of workloads. Existing studies typically monitor workload characteristics and build models that map these characteristics to actual demand. However, workload characteristics are multidimensional, and the impact of each dimension on resource demand differs, so it requires differentiated treatment when building models. This paper proposes a Correlation-Based Universal Resource Matching (CBURM) strategy to realize a Heterogeneous and Elastic Cloud Service System (HECSS). CBURM consists of a Correlation-based resource Demand Evaluation (CDE) method and a Universal Resource Measurement (URM) scheme. Specifically, CDE discriminates the relevance of each dimension in workload characteristics, based on the correlations between workload characteristics and the demand. Then, it generates resource demand decisions dimension by dimension, from the most relevant to the least relevant dimensions. After that, it generates a complete decision tree model to evaluate subsequent workload demand for heterogeneous resources. Finally, URM optimizes the resource allocation to achieve a low-overhead resource matching. Experimental results show that, URM reduces the total comprehensive operation cost by 82%+, compared to a normal resource allocation scheme. Additionally, CDE outperforms two state-of-the-art methods (LTP and 2SP), with its performance closer to the ideal baseline. Specifically, CDE achieves a 40.275% overall resource saving rate, which is 38.62% higher than LTP and 8.46% higher than 2SP. Besides, CDE achieves a 92.43% average service quality satisfaction ratio, higher than the 82.9% and 88.83% achieved respectively by LTP and 2SP.
Cheng Hu 0004, Yuhui Deng 0001, Wenyu Luo, Qingsong Wei, Geyong Min
IEEE Trans. Serv. Comput.1
2022 Improve the Energy Efficiency of Datacenters With the Awareness of Workload Variability
abstract
In modern datacenters, huge energy consumption is a significant problem that remains to be solved. Previous works reduce the system energy consumption by switching the idle servers to a low-power state. However, the workload demands on servers change dynamically and mainly depend on the real-time workload status. To maintain the system energy efficiency, when providing servers with some servers reserved, the status of workloads should be carefully considered. Generally, the status of workloads is characterized by some key factors sampled from the workloads. However, under dynamic workload demands, the accuracy of these sampled values varies. To accurately assess the status of server workloads, in this paper, we propose a Dynamic Time Scale based server Provision (DTSP) method, which takes the variability of workloads into consideration when providing servers for workload demands. To obtain accurate factor values indicating real-time workload, DTSP samples several key workload factors, including the coefficient of variation of arrival intervals, the request arrival rates of current workload and previous workload, and the mean service time of current requests, with a dynamic compatible rate. With these sampled factors, DTSP can accurately estimate the demands of workloads on servers and provide appropriate numbers of servers for the dynamic workloads. Extensive experiments demonstrate that taking the workload variability into consideration, DTSP can significantly promote the energy efficiency of a datacenter.
Cheng Hu 0004, Yingya Guo, Yuhui Deng 0001, Longya Lang
IEEE Trans. Netw. Serv. Manag.1
2021 QoS Promotion in Energy-Efficient Datacenters Through Peak Load Scheduling
abstract
To build energy-efficient datacenters, one widely used way is to dynamically manipulate the quantity of available hardware resources on demand. However, when bursty workloads appear, additional time overhead is required for resource gearing, thus incurring a performance degradation. To explore this problem, we present an intelligible analysis on the request handing in a VM. From the analysis, we find that, when workloads are overloaded (i.e., peak loads appear), the number of QoS guaranteed requests can be greatly increased by deferring the scheduling of a few requests. Inspired by this finding, we propose a Peak Load Scheduling Control (PLSC) method to promote the Quality of Service (QoS) of peak loads for modern energy-efficient datacenters. However, peak loads are usually difficult to identify. To overcome this difficulty, PLSC tracks the number of requests residing in a VM by leveraging a two-tier request queue maintained by it. When the number exceeds the capability of the VM, it means that peak loads appear. In this case, PLSC adds some delay-tolerant requests to the secondary queue. The scheduling of requests in the secondary queue is controlled with a lower priority than that of requests in the primary queue. Sequentially, with critical requests maintained in the primary queue, PLSC shortens the response time of critical requests. In addition, PLSC expands the number of QoS-guaranteed requests. Comprehensive experiments are conducted to attest the effectiveness of PLSC, by simulating a typical energy-efficient datacenter. The experimental results show that PLSC significantly promotes the QoS of workloads with a negligible impact on energy saving.
Cheng Hu 0004, Yuhui Deng 0001, Geyong Min, Ping Huang 0001, Xiao Qin 0001
IEEE Trans. Cloud Comput.1
2021 Estimating the Resource Demand in Power-Aware Clusters by Regressing a Linearly Dependent Relation
abstract
Large-scale clusters are often built with over-provisioned service resources, so as to satisfy the huge demand raised by enormous users in cloud environments. By estimating the resource demand of workloads, an on-demand resource provisioning method can be realized in these clusters, thus improving the energy efficiency. However, to guarantee Quality of Service (QoS), the resource demand of workload should be accurately estimated so as to provide suitable resources. Many statistical approaches estimate actual resource demand based on some workload features. But the relations between actual resource demand and workload features are generally obscure, and it's a big challenge to gain an accurate estimation under an obscure relation. In this paper, by considering a cluster as a queueing system, we construct a linearly dependent relation between resource demand and multiple feature combinations. The linearly dependent relation is inconstant due to its variable coefficients. Then, to ascertain specific relations which match actual situations, we design a Basic Linear regression (BL) algorithm. BL can obtain the optimal values for these coefficients, thus determining the inconstant relation to specific ones. Finally, we propose a Constructed Linear regression (CL) approach to estimate actual resource demands. CL forms a two-layer neural network by using several processes of BL as the neurons. To evaluate CL, we realize an On-Demand Resource Provisioning (ODRP) method in a typical power-aware cluster. Several evaluation metrics are proposed for conducting extensive experiments. The experimental results show that CL is effective to make accurate estimations.
Cheng Hu 0004, Yuhui Deng 0001, Laurence T. Yang, Yufan Zhao
IEEE Trans. Sustain. Comput.1
2019 Aggregating correlated cold data to minimize the performance degradation and power consumption of cold storage nodes
Cheng Hu 0004, Yuhui Deng 0001
J. Supercomput.1
2018 Improving Restore Performance of Deduplication Systems by Leveraging the Chunk Sequence in Backup Stream
Yuhui Deng 0001, Cheng Hu 0004, Lei Si 0003
ICA3PP (1)3
2015 An Energy-Aware File Relocation Strategy Based on File-Access Frequency and Correlations
Cheng Hu 0004, Yuhui Deng 0001
ICA3PP (4)1