Ziniu Hu

Ziniu Hu

Auto-generated profile, based on publicly available information

Ziniu Hu

University of California Los Angeles

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
21 October 2024
Verified
Conference Paper
Open access
XCXiusi Chen
Xiusi Chen
WWWei-Yao Wang
Wei-Yao Wang
ZHZiniu Hu
Ziniu Hu
DRDavid Adrian Reynoso
David Adrian Reynoso
KJKun Jin
Kun Jin
PBP. Jeffrey Brantingham
P. Jeffrey Brantingham

13 May 2024
Verified
Conference Paper
Open access
CHChi-Yang Hsu
Chi-Yang Hsu
KCKyle Cox
Kyle Cox
JXJiawei Xu
Jiawei Xu
ZTZhen Tan
Zhen Tan
TZTianhua Zhai
Tianhua Zhai
YDYing Ding
Ying Ding

25 April 2026 in ACM Computing Surveys
Verified
Journal Article
Open access
SZShichang Zhang
Shichang Zhang
ASAtefeh Sohrabizadeh
Atefeh Sohrabizadeh
CWCheng Wan
Cheng Wan
ZHZijie Huang
Zijie Huang
ZHZiniu Hu
Ziniu Hu
YSYizhou Sun
Yizhou Sun
Graph neural networks (GNNs) are emerging for machine learning research on graph-structured data. GNNs achieve state-of-the-art performance on many tasks, but they face scalability challenges when it comes to real-world applications that have numerous data and strict latency requirements. Many studies have been conducted on how to accelerate GNNs in an effort to address these challenges. These acceleration techniques touch on various aspects of the GNN pipeline, from smart training and inference algorithms to efficient systems and customized hardware. As the amount of research on GNN acceleration has grown rapidly, there lacks a systematic treatment to provide a unified view and address the complexity of relevant works. In this survey, we provide a taxonomy of GNN acceleration, review the existing approaches, and suggest future research directions. Our taxonomic treatment of GNN acceleration connects the existing works and sets the stage for further development in this area.

9 September 2024
Verified
Conference Paper
Open access
ZQZongyue Qin
Zongyue Qin
YBYunsheng Bai
Yunsheng Bai
ASAtefeh Sohrabizadeh
Atefeh Sohrabizadeh
ZDZijian Ding
Zijian Ding
ZHZiniu Hu
Ziniu Hu
JCJason Cong
Jason Cong
In recent years, domain-specific accelerators (DSAs) have gained popularity for applications such as deep learning and autonomous driving. To facilitate DSA designs, programmers use high-level synthesis (HLS) to compile a high-level description written in C/C++ into a design with low-level hardware description languages that eventually synthesize DSAs on circuits. However, creating a high-quality HLS design still demands significant domain knowledge, particularly in microarchitecture decisions expressed as pragmas. Thus, it is desirable to automate such decisions with the help of machine learning for predicting the quality of HLS designs, requiring a deeper understanding of the program that consists of original code and pragmas. Naturally, these programs can be considered as sequence data. In addition, these programs can be compiled and converted into a control data flow graph (CDFG). But existing works either fail to leverage both modalities or combine the two in shallow or coarse ways. We propose ProgSG, a model that allows interaction between the source code sequence modality and the graph modality in a deep and fine-grained way. To alleviate the scarcity of labeled designs, a pre-training method is proposed based on a suite of compiler's data flow analysis tasks. Experimental results show that ProgSG reduces the RMSE of design performance predictions by up to 22%, and identifies designs with an average of 1.10× and 1.26× (up to 8.17× and 13.31×) performance improvement in design space exploration (DSE) task compared to HARP and AutoDSE, respectively.