Dengke Han

Dengke Han

Auto-generated profile, based on publicly available information

Dengke Han

State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
RXRunzhen Xue
Runzhen Xue
DHDengke Han
Dengke Han
MYMingyu Yan
Mingyu Yan
MZMo Zou
Mo Zou
XYXiaocheng Yang
Xiaocheng Yang
DFDongrui Fan
Dongrui Fan
Heterogeneous graph neural networks (HGNNs) have emerged as powerful algorithms for processing heterogeneous graphs (HetGs), widely used in many critical fields. To capture both structural and semantic information in HetGs, HGNNs first aggregate the neighboring feature vectors for each vertex in each semantic graph and then fuse the aggregated results across all semantic graphs for each vertex. Unfortunately, existing graph neural network accelerators are ill-suited to accelerate HGNNs. This is because they fail to efficiently tackle the specific execution patterns and exploit the high-degree parallelism as well as data reusability inside and across the processing of semantic graphs in HGNNs. In this work, we first quantitatively characterize a set of representative HGNN models on GPU to disclose the execution bound of each stage, inter-semantic-graph parallelism, and inter-semantic-graph data reusability in HGNNs. Guided by our findings, we propose a high-performance HGNN accelerator, HiHGNN, to alleviate the execution bound and exploit the newfound parallelism and data reusability in HGNNs. Specifically, we first propose a bound-aware stage-fusion methodology that tailors to HGNN acceleration, to fuse and pipeline the execution stages being aware of their execution bounds. Second, we design an independency-aware parallel execution design to exploit the inter-semantic-graph parallelism. Finally, we present a similarity-aware execution scheduling to exploit the inter-semantic-graph data reusability. Compared to the state-of-the-art software framework running on NVIDIA GPU T4 and GPU A100, HiHGNN respectively achieves an average 40.0× and 8.3× speedup as well as 99.59% and 99.74% energy reduction with quintile the memory bandwidth of GPU A100.

23 June 2024
Verified
Conference Paper
Open access
RXRunzhen Xue
Runzhen Xue
MYMingyu Yan
Mingyu Yan
DHDengke Han
Dengke Han
YTYihan Teng
Yihan Teng
ZTZhimin Tang
Zhimin Tang
DFDongrui Fan
Dongrui Fan
Heterogeneous Graph Neural Networks (HGNNs) have broadened the applicability of graph representation learning to heterogeneous graphs. However, the irregular memory access pattern of HGNNs leads to the buffer thrashing issue in HGNN accelerators. In this work, we identify an opportunity to address buffer thrashing in HGNN acceleration through an analysis of the topology of heterogeneous graphs. To harvest this opportunity, we propose a graph restructuring method and map it into a hardware frontend named GDR-HGNN. GDR-HGNN dynamically restructures the graph on the fly to enhance data locality for HGNN accelerators. Experimental results demonstrate that, with the assistance of GDR-HGNN, a leading HGNN accelerator achieves an average speedup of 14.6X and 1.78X compared to the state-of-the-art software framework running on A100 GPU and itself, respectively.

6 December 2023 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
DWDuo Wang
Duo Wang
MYMingyu Yan
Mingyu Yan
YTYihan Teng
Yihan Teng
DHDengke Han
Dengke Han
XLXin Liu
Xin Liu
DFDongrui Fan
Dongrui Fan
To accelerate time-consuming multiobjective design space exploration of CPU microarchitecture, previous work trains prediction models using a set of performance metrics derived from a few simulations, then predicts the rest. Unfortunately, the low accuracy of models limits the exploration effect, and how to achieve a good tradeoff between multiple objectives while reducing exploration time is challenging. In this article, we investigate various prediction models and find out the most accurate basic model. We enhance the model by ensemble learning and generate Pareto-rank-based sample weights to improve prediction accuracy. A hypervolume-improvement-based optimization method to tradeoff between multiple objectives is proposed together with a uniformity-aware selection algorithm to jump out of the local optimum. Furthermore, the exploration time is reduced owing to a proposed Pareto-aware filter algorithm. Experiments demonstrate that our open-source framework can reduce the distance to the Pareto-optimal set by 39% compared with the state-of-the-art framework.

5 June 2023
Verified
Conference Paper
Open access
DWDuo Wang
Duo Wang
MYMingyu Yan
Mingyu Yan
YTYihan Teng
Yihan Teng
DHDengke Han
Dengke Han
XYXiaochun Ye
Xiaochun Ye
DFDongrui Fan
Dongrui Fan
To accelerate the time-consuming multi-objective design space exploration of CPU, previous work trains prediction models using a set of cycle per instruction and power performance metrics derived from a few simulations for sampled design points, then exploits the predicted metrics of the rest design points to perform exploration. Unfortunately, the low accuracy of models limits the exploration effect, and how to balance exploitation and exploration while reducing time is challenging. In this paper, we design an open-source high-accurate multi-objective exploration framework. A bagging ensemble prediction model is designed for high-accurate prediction. An upper confidence bound hypervolume improvement optimization method is proposed to approach the Pareto optimal set and balance exploitation and exploration. A Pareto-aware filter algorithm is proposed to reduce the exploration time. Experiments demonstrate that our framework can reduce the distance to the Pareto optimal set by 17.2%, prediction error by 64.8%, and exploration time by 75.1% compared with the state-of-the-art work.

19 March 2025 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
DHDengke Han
Dengke Han
MYMingyu Yan
Mingyu Yan
XYXiaochun Ye
Xiaochun Ye
DFDongrui Fan
Dongrui Fan
Owing to their remarkable representation capabilities for heterogeneous graph data, Heterogeneous Graph Neural Networks (HGNNs) have been widely adopted in many critical real-world domains such as recommendation systems and medical analysis. Prior to their practical application, identifying the optimal HGNN model parameters tailored to specific tasks through extensive training is a time-consuming and costly process. To enhance the efficiency of HGNN training, it is essential to characterize and analyze the execution semantics and patterns within the training process to identify performance bottlenecks. In this study, we conduct a comprehensive quantification and in-depth analysis of two mainstream HGNN training scenarios, including single-GPU and multi-GPU distributed training. Based on the characterization results, we reveal the performance bottlenecks and their underlying causes in different HGNN training scenarios and propose optimization guidelines from both software and hardware perspectives.

26 August 2024
Verified
Book Chapter
Closed access
PDF file
DHDengke Han
Dengke Han
MWMeng Wu
Meng Wu
RXRunzhen Xue
Runzhen Xue
MYMingyu Yan
Mingyu Yan
XYXiaochun Ye
Xiaochun Ye
DFDongrui Fan
Dongrui Fan