Kezhao Huang

Kezhao Huang

Auto-generated profile, based on publicly available information

Kezhao Huang

Tsinghua University, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
22 April 2024
Verified
Conference Paper
Open access
KHKezhao Huang
Kezhao Huang
JZJidong Zhai
Jidong Zhai
LZLiyan Zheng
Liyan Zheng
HWHaojie Wang
Haojie Wang
YJYuyang Jin
Yuyang Jin
XSXipeng Shen
Xipeng Shen
Graph Neural Network (GNN) has emerged as an important workload for learning on graphs. With the size of graph data and the complexity of GNN model architectures increasing, developing an efficient GNN system grows more important. As GNN has heavy neural computation workloads on a large graph, it is crucial to partition the entire workload into smaller parts for parallel execution and optimization. However, existing approaches separately partition graph data and GNN operations, resulting in inefficiency and large data movement overhead. To address this problem, we present WiseGraph, a GNN training framework exploring the joint optimization space of graph data partition and GNN operation partition. To bridge the gap between the two classes of partitions, we propose a workload abstraction tailored to GNN, gTask, which can not only describe existing GNN partition strategies as special cases but also exploit new optimization opportunities. Based on gTasks, WiseGraph effectively generates partition plans adaptive to input graph data and GNN models. Evaluation on five typical GNN models shows that WiseGraph outperforms existing GNN frameworks by 2.04× and 2.22× for single and multiple GPU training. WiseGraph is publicly available at https://github.com/xxcclong/CxGNN-Compute/.

5 January 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
CZChen Zhang
Chen Zhang
CZChenggang Zhao
Chenggang Zhao
JHJiaao He
Jiaao He
SCShengqi Chen
Shengqi Chen
LZLiyan Zheng
Liyan Zheng
JZJidong Zhai
Jidong Zhai
In this article we present our results from the SC19 Student Cluster Competition Reproducibility Challenge. The challenge entails reproducing the article entitled “Computing Planetary Interior Normal Modes with A Highly Parallel Polynomial Filtering Eigensolver” presented at SC'18, which proposes a parallel polynomial filtered Lanczos algorithm to directly calculate the planetary normal modes of heterogeneous planets. The proposed algorithm showed excellent performance with relatively low memory consumption and high parallel efficiency. In this work, we reproduce the scaling tests in that article on a cluster using Intel Cascade Lake architecture and use the proposed algorithm to illustrate specific normal modes of Mars. We compare the results obtained on our cluster with those in the original article. We also design a new metric to better analyze the results. In addition, we use the profiling tool Intel VTune Amplifier to explain our discoveries. Our results demonstrate that the given models show great scalability, which is similar to the original article. The required normal modes of Mars are also successfully calculated and visualized.

1 March 2025
Verified
Conference Paper
Open access
ZMZixuan Ma
Zixuan Ma
HWHaojie Wang
Haojie Wang
JXJingze Xing
Jingze Xing
SHShuhong Huang
Shuhong Huang
LZLiyan Zheng
Liyan Zheng
JZJidong Zhai
Jidong Zhai
Tensor compilers play a critical role in optimizing deep neural networks (DNNs), with memory performance emerging as a key bottleneck in code generation for DNN models. Existing tensor compilers are constrained by inefficient auto-tuning algorithms. They either must deploy coarse-grained descriptions, thus miss potential optimization, or struggle with vast search spaces, rendering auto-tuning inapplicable. Tensor compilers require a more holistic optimization of memory performance to overcome these constraints. To address this issue, we focus our optimization objective on memory performance, which allows us to design monotonic optimization methods, significantly enhancing the efficiency of auto-tuning and thus enabling auto-tuning on a fine-granularity description. Based on these observations, we propose IntelliGen, a tensor compiler with instruction-level auto-tuning and monotonic memory optimization. We design an instruction-level graph description, and a monotonic optimization method for optimization on . Benefiting from auto-tuning techniques with fine-grained description, IntelliGen demonstrates significant speedup of up to 3.13×, 3.55×, and 16.9× (averaging 1.46×, 1.85×, and 2.30×, respectively) on NVIDIA GPUs, AMD GPUs, and Cambricon MLUs over the most efficient existing frameworks.

16 November 2025
Verified
Book Chapter
Closed access
PDF file
YJYuyang Jin
Yuyang Jin
JZJidong Zhai
Jidong Zhai
KHKezhao Huang
Kezhao Huang
WZWeimin Zheng
Weimin Zheng

28 January 2026
Verified
Conference Paper
Open access
CWChengzhang Wu
Chengzhang Wu
LZLiyan Zheng
Liyan Zheng
HWHaojie Wang
Haojie Wang
KHKezhao Huang
Kezhao Huang
ZMZixuan Ma
Zixuan Ma
JZJidong Zhai
Jidong Zhai