Hanchen Jin

Hanchen Jin

Auto-generated profile, based on publicly available information

Hanchen Jin

Graduate School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, USA

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
13 November 2024 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
HJHanchen Jin
Hanchen Jin
ZYZichao Yue
Zichao Yue
ZZZhongyuan Zhao
Zhongyuan Zhao
YDYixiao Du
Yixiao Du
CDChenhui Deng
Chenhui Deng
ZZZhiru Zhang
Zhiru Zhang
Sparse linear algebra (SLA) operations are fundamental building blocks for many important applications such as data analytics, graph processing, machine learning, and scientific computing. In particular, four compute kernels in SLA are widely used, including SpMV, SpMM, SpMSpV, and SpGEMM. Recently, an active area of research has emerged to build specialized hardware accelerators for these SLA kernels. However, existing efforts mostly focus on accelerating a single kernel and the proposed accelerator architectures are often limited to a specific compute pattern, such as inner, outer, or row-wise product. This work proposes, a high-performance and versatile sparse accelerator that supports all four important SLA kernels while being configurable to execute the compute patterns suitable for different kernels under various degrees of sparsity. To enable rapid exploration of the large architectural design and configuration space, we devise an analytical model to estimate the performance of an SLA kernel running on a given hardware configuration using a specific compute pattern. Guided by our model, we build a flexible yet efficient accelerator architecture that maximizes the resource sharing amongst the hardware modules used for different SLA kernels and the associated compute patterns. We evaluate the performance of using gem5 on a diverse set of matrices from SuiteSparse. Our experiment results show that achieves a comparable or higher throughput with increased bandwidth efficiency than the state-of-the-art accelerators that are tailor-made for a specific SLA kernel. In addition, we evaluate on a real-world application called label propagation, an iterative graph-based learning algorithm that involves multiple SLA kernels and exhibits varying degrees of sparsity across iterations. Compared to CPU-and GPU-based executions, speeds up the label propagation algorithm by 12.0× and 1.7×, respectively.