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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wuqing Zhao

dblp:39/3694 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

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

Systems, architecture and hardware · 5 · 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
GPUs and heterogeneous computing · 56% Energy-efficient computing · 44%

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

TopicWeightPapersLastEvidence papers
Energy-efficient computing › power management
dynamic voltage and frequency scaling
0.712023
Warp-Aware Adaptive Energy Efficiency Calibration for Multi-GPU Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
GPUs and heterogeneous computing
GPU power management
0.712023
Warp-Aware Adaptive Energy Efficiency Calibration for Multi-GPU Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
GPUs and heterogeneous computing
multi-GPU computing
0.212023
Warp-Aware Adaptive Energy Efficiency Calibration for Multi-GPU Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023

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

runtime energy monitoring · 0.7adaptive frequency regulation · 0.7
YearPublicationVenuePosition
2023 Warp-Aware Adaptive Energy Efficiency Calibration for Multi-GPU Systems
abstract
Massive GPU acceleration processors have been used in high-performance computing systems. The Dennard scaling has led to power and thermal constraints limiting the performance of such systems. The demand for both increased performance and energy efficiency is highly desired. This article presents a multilayer low-power optimization method for warps and tasks parallelisms. We present a dynamic frequency regulation scheme for performance parameters in terms of load balance and load imbalance. The method monitors the energy parameters in runtime and adjusts adaptively the voltage level to ensure performance efficiency with energy reduction. The experimental results show that the multilayer low-power optimization with dynamic frequency regulation can achieve 40% energy consumption reduction with only 1.6% performance degradation, thus reducing 59% maximum energy consumption. It can further save about 30% energy consumption in comparison with the single-layer energy optimization.
Zhuowei Wang 0001, Lianglun Cheng, Hai Wan, Wuqing Zhao, Tao Wang 0014
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.5
2019 Energy optimization of parallel programs in a heterogeneous system by combining processor core-shutdown and dynamic voltage scaling
Zhuowei Wang 0001, Hao Wang 0003, Wuqing Zhao, Lianglun Cheng
Future Gener. Comput. Syst.3
2018 Three-level performance optimization for heterogeneous systems based on software prefetching under power constraints
Zhuowei Wang 0001, Wuqing Zhao, Hao Wang 0003, Lianglun Cheng
Future Gener. Comput. Syst.2
2016 An architecture-level graphics processing unit energy model
abstract
Summary With the continued development of hardware and software, graphics processing unit (GPU) has been used in general purpose computational fields, while accelerating applications for CPUs. To achieve high computing performance, a GPU typically includes hundreds of computing units. The high density of computing resource on‐chip incurs high power consumption as well as engendering high performance. The power consumption problem has become one of the most important problems for the development of GPUs. Focusing on a CPU‐GPU heterogeneous parallel system, this research proposed an architecture‐level GPU energy model, with the aim of reducing system energy demand and improving system efficiency. Taking the influences of memory and temperature on GPU energy demand into account, a dynamic energy model based on division of computation and memory and a static energy model based on real‐time temperature perception were established. Validation, through the evaluation and comparative analysis of nine typical GPU programmes, demonstrated that these models could reduce chip energy demand under the performance constraint conditions imposed. Copyright © 2014 John Wiley & Sons, Ltd.
Zhuowei Wang 0001, Lianglun Cheng, Wuqing Zhao, Naixue Xiong
Concurr. Comput. Pract. Exp.3
2011 GPU Acceleration for GRAPES Meteorological Model
abstract
There is heavy computation involved in Global / Regional Assimilation and Prediction System (GRAPES) which is a typical non-linear discrete system of the Earth's atmosphere developed for numerical weather prediction. Researchers have recently paid a lot of attention to the parallel acceleration of the GRAPES model by low-cost, low-power, high-performance Graphics Processor Units (GPUs). We implement in this paper the acceleration for the GRAPES model in GPUs, which is however not as efficient as supposed. On this basis, we further propose strategies to optimize the performance, including the ease of data transmission time, reducing the amount of device memory loaded and used to store various objects, and avoiding the branches of thread control flows. One can find from the experiments that, parallel acceleration with GPUs helps to improve the performance of GRAPES in terms of measures like accuracy and timeliness.
Zhuowei Wang 0001, Xianbin Xu, Naixue Xiong, Laurence T. Yang, Wuqing Zhao
HPCC5
2008 A Weight-Based Dynamic Replica Replacement Strategy in Data Grids
abstract
Data grid is a very important and useful technique to process the large number of data produced by scientific experiments and simulations. However, the high latency of the Internet turns to be the bottleneck in accessing the files in the grid. The replication strategy can shorten the time of getting the files by creating many replicas and storing the replicas in appropriate locations. Restricted by the storage capacity, it is important to design an effective algorithm for the replication replacement task. In this paper, we propose a novel replacement strategy which calculates the weight of replicas based on the access times in the future time window, the access bandwidth and the file size. Results from the simulation procedure show the better performance of our algorithm than former ones.
Wuqing Zhao, Xianbin Xu, Naixue Xiong, Zhuowei Wang 0001
APSCC1