Zhiyuan Shao

Zhiyuan Shao

Auto-generated profile, based on publicly available information

Zhiyuan Shao

Huazhong University of Science and Technology (HUST)

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
31 July 2023 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
RLRuo-Shi Li
Ruo-Shi Li
PPPing Peng
Ping Peng
ZSZhi-Yuan Shao
Zhi-Yuan Shao
HJHai Jin
Hai Jin
RZRan Zheng
Ran Zheng

16 December 2023 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
HGHongru Gao
Hongru Gao
XLXiaofei Liao
Xiaofei Liao
ZSZhiyuan Shao
Zhiyuan Shao
KLKexin Li
Kexin Li
JCJiajie Chen
Jiajie Chen
HJHai Jin
Hai Jin

24 April 2019
Verified
Book Chapter
Closed access
PDF file
YLYinuo Li
Yinuo Li
ZSZhiyuan Shao
Zhiyuan Shao
DYDongxiao Yu
Dongxiao Yu
XLXiaofei Liao
Xiaofei Liao
HJHai Jin
Hai Jin

2 April 2024
Verified
Conference Paper
Open access
SXShaoxian Xu
Shaoxian Xu
SLSitong Lu
Sitong Lu
ZSZhiyuan Shao
Zhiyuan Shao
XLXiaoFei Liao
XiaoFei Liao
HJHai Jin
Hai Jin
On FPGAs, customizing data parallelism can significantly improve performances of applications. However, a large number of applications, such as sparse matrix multiplication, exhibit irregular memory access patterns, for which further improvements are limited by their low memory access efficiency. It is challenging to solve using traditional caches due to the massive cache misses. To address this, prior research efforts are dedicated to developing non-blocking caches withMiss Status Holding Registers (MSHRs) to manage the cache misses and mitigate stalls caused by the misses. However, exsiting approaches allocate dedicatedBlock RAMs (BRAMs) for implementing MSHRs. It introduces complexities in MSHR configurations and potential resource inefficiencies, as MSHR demand is highly dynamic when solving real-world problems. In this paper, we present MiCache, an MSHR-inclusive non-blocking cache design where cache entries and MSHR entries share the same storage spaces to support the dynamic demand for MSHRs during the executions of applications. We design a consistent storage structure for cache and MSHR entries, ensuring a unified and efficient mechanism for cache/MSHR lookup and data access. To further improve the performance, we design a parallel dual pipeline, one of which processes the requests from processing elements, and the other processes the responses from off-chip memory. We implement and evaluate our proposal on a Xilinx Alveo U280 board. Evaluation results show that, compared to the state-of-the-art non-blocking cache design on FPGAs, with equivalent cache configurations, MiCache reduces the BRAM consumption by up to 17%. When using the same amount of BRAM resources, MiCache achieves up to 1.56x performance improvement.

30 April 2024 in ACM Transactions on Reconfigurable Technology and Systems
Verified
Journal Article
Open access
KLKexin Li
Kexin Li
SXShaoxian Xu
Shaoxian Xu
ZSZhiyuan Shao
Zhiyuan Shao
RZRan Zheng
Ran Zheng
XLXiaoFei Liao
XiaoFei Liao
HJHai Jin
Hai Jin
The introduction of High Bandwidth Memory (HBM) to the FPGA chip makes it possible for an FPGA-based accelerator to leverage the huge memory bandwidth of HBM to improve its performance when implementing a specific algorithm, which is especially true for the Breadth-First Search (BFS) algorithm that demands a high bandwidth for accessing the graph data stored in memory. Different from traditional FPGA-DRAM platforms where memory bandwidth is the precious resource due to the limited DRAM channels, FPGA chips equipped with HBM have much higher memory bandwidths provided by the large quantities of HBM channels, but still a limited amount of logic (LUT, FF, and BRAM/URAM) resources. Therefore, the key to design a high-performance BFS accelerator on an HBM-enhanced FPGA chip is to efficiently use the logic resources to build as many as possible Processing Elements (PEs) and configure them flexibly to obtain as high as possible effective memory bandwidth that is useful to the algorithm from the HBM, rather than partially emphasizing the absolute memory bandwidth. To exploit as high as possible effective bandwidth from the HBM, ScalaBFS2 conducts BFS in graphs in a vertex-centric manner and proposes designs, including the independent module (HBM Reader) for memory accessing, multi-layer crossbar, and PEs that implement hybrid mode (i.e., capable of working in both push and pull modes) algorithm processing, to utilize the FPGA logic resources efficiently. Consequently, ScalaBFS2 is able to build up to 128 PEs on the XCU280 FPGA chip (produced with the 16 nm process and configured with two HBM2 stacks) of a Xilinx Alveo U280 board and achieves performance of 56.92 Giga Traversed Edges Per Second (GTEPS) by fully using its 32 HBM memory channels. Compared with the state-of-the-art graph processing system (i.e., ReGraph) built on top of the same board, ScalaBFS2 achieves 2.52x~4.40x performance speedups. Moreover, when compared with Gunrock running on an Nvidia A100 GPU that is produced with the 7 nm process and configured with five HBM2e stacks, ScalaBFS2 achieves 1.34x~2.40x speedups on absolute performance, and 7.35x~13.18x speedups on power efficiency.

21 March 2025 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
JYJianrong Yan
Jianrong Yan
WJWenbin Jiang
Wenbin Jiang
DHDongao He
Dongao He
SWSuyang Wen
Suyang Wen
YLYang Li
Yang Li
ZSZhiyuan Shao
Zhiyuan Shao
Graph Neural Networks (GNNs) have achieved remarkable successes in various graph-based learning tasks, thanks to their ability to leverage advanced GPUs. However, GNNs currently face challenges arising from the concurrent use of advanced Tensor Cores (TCs) and CUDA Cores (CDs) in GPUs. These challenges are further exacerbated due to repeated, inefficient, and redundant aggregations in GNN that result from the high sparsity and irregular non-zero distribution of real-world graphs. We propose RT-GNN, a GNN framework based on the fusion of advanced TC and CD units, to eliminate the aforementioned redundancies by exploiting the properties of an adjacency matrix. First, a novel GNN representation technique, hierarchical embedding graph (HEG) is proposed to manage the intermediate aggregation results hierarchically, which can further avoid redundancy in intermediate aggregations elegantly. Next, to address the inherent sparsity of graphs, RT-GNN places the blocks (a.k.a. tiles) in HEG onto TCs and CDs according to their sparsity by a new block-based row-wise multiplication approach, which assembles TCs and CDs to work concurrently. Experimental results demonstrate that HEG outperforms HAG by an average speedup of 19.3× for redundancy elimination performance, especially up to 72× speedup on the dataset of ARXIV. Moreover, for overall performance, RT-GNN outperforms state-of-the-art GNN frameworks (including DGL, HAG, GNNAdvisor, and TC-GNN) by an average factor of 3.1× while maintaining or even improving the task accuracy.