Lingxiang Yin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lingxiang Yin has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Hao Zheng
University of Central Florida, Orlando, FL, USA
4 shared publications - Amir Ghazizadeh Ahsaei
University of Central Florida, Orlando, FL, USA
2 shared publications - Fangzhou Ye
University of Central Florida, Orlando, FL, USA
2 shared publications - Fan Yao
University of Central Florida, Orlando, FL, USA
1 shared publication - Joe Walston
Synopsys, Inc., Sunnyvale, USA
1 shared publication - Jun Wang
University of Central Florida
1 shared publication
Latest Publications
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1535-1548
Rethinking Tiling and Dataflow for SpMM Acceleration: A Graph Transformation Framework
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1535-1548
Open AccessRethinking Tiling and Dataflow for SpMM Acceleration: A Graph Transformation Framework
- Open Access
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-9
CircuitSeer: RTL Post-PnR Delay Prediction via Coupling Functional and Structural Representation
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessCircuitSeer: RTL Post-PnR Delay Prediction via Coupling Functional and Structural Representation
- Open Access
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
EGMA: Enhancing Data Reuse and Workload Balancing in Message Passing GNN Acceleration via Gram Matrix Optimization
Graph Neural Networks (GNNs) have been widely used to handle intricate graph-related problems, in which complex vertex and edge operations are performed in the form of message passing between vertices. Such complex GNN operations are highly dependent on the graph structure and can no longer be characterized as sparse-dense or general matrix multiplications. Consequently, current matrix-based data reuse and workload balancing optimizations have limited applicability to Message Passing-based GNN acceleration. In this paper, we leverage the mathematical insights from Gram Matrix to simultaneously exploit data reuse and workload balancing opportunities for message passing-based GNN accelerations. Upon this insight, we further propose a novel accelerator, named EGMA, that can efficiently facilitate a wide range of GNN models with improved data reuse and workload balance. Consequently, EGMA can achieve performance speedup by 1.57×, 1.72×, and 1.43× and energy reduction by 38.19%, 34.02%, and 24.54% on average compared to Betty, FlowGNN, and ReGNN, respectively.
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessEGMA: Enhancing Data Reuse and Workload Balancing in Message Passing GNN Acceleration via Gram Matrix Optimization
Graph Neural Networks (GNNs) have been widely used to handle intricate graph-related problems, in which complex vertex and edge operations are performed in the form of message passing between vertices. Such complex GNN operations are highly dependent on the graph structure and can no longer be characterized as sparse-dense or general matrix multiplications. Consequently, current matrix-based data reuse and workload balancing optimizations have limited applicability to Message Passing-based GNN acceleration. In this paper, we leverage the mathematical insights from Gram Matrix to simultaneously exploit data reuse and workload balancing opportunities for message passing-based GNN accelerations. Upon this insight, we further propose a novel accelerator, named EGMA, that can efficiently facilitate a wide range of GNN models with improved data reuse and workload balance. Consequently, EGMA can achieve performance speedup by 1.57×, 1.72×, and 1.43× and energy reduction by 38.19%, 34.02%, and 24.54% on average compared to Betty, FlowGNN, and ReGNN, respectively.
- Open Access
- 5 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 489-495
Exploring Architecture, Dataflow, and Sparsity for GCN Accelerators: A Holistic Framework
Recent years have seen an increasing number of Graph Convolutional Network (GCN) models employed in various real-world applications. However, designing efficient architectures for GCN acceleration remains challenging due to the varied sparsity across graph datasets. Despite significant efforts, very few of the existing works have considered a holistic view of the entire GCN accelerator design, and therefore, the dynamic interactions between architecture, dataflow (i.e., data reuse and parallelization strategies), and compression format are not well studied In this paper, we endeavor to develop a holistic framework supporting the rapid exploration of GCN design space - synergizing architecture, dataflow, and sparsity optimizations. Specifically, we implement a variety of compression formats tailored for handling extreme and irregular sparsity. Moreover, we propose a generic GCN architecture capable of supporting various dataflow and compression formats in one combined architecture. Given the exploded GCN design space, a genetic algorithm is implemented to facilitate rapid exploration while suggesting an optimal GCN solution with suitable dataflow and compression formats. Our proposed framework can achieve 12.3X, 2.2X, and 1.37X speedup and 15.3X, 3.7X, and 1.6X energy efficiency on average as compared to HyGCN, AWB-GCN, and GCNAX, respectively.
- 5 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 489-495
Open AccessExploring Architecture, Dataflow, and Sparsity for GCN Accelerators: A Holistic Framework
Recent years have seen an increasing number of Graph Convolutional Network (GCN) models employed in various real-world applications. However, designing efficient architectures for GCN acceleration remains challenging due to the varied sparsity across graph datasets. Despite significant efforts, very few of the existing works have considered a holistic view of the entire GCN accelerator design, and therefore, the dynamic interactions between architecture, dataflow (i.e., data reuse and parallelization strategies), and compression format are not well studied In this paper, we endeavor to develop a holistic framework supporting the rapid exploration of GCN design space - synergizing architecture, dataflow, and sparsity optimizations. Specifically, we implement a variety of compression formats tailored for handling extreme and irregular sparsity. Moreover, we propose a generic GCN architecture capable of supporting various dataflow and compression formats in one combined architecture. Given the exploded GCN design space, a genetic algorithm is implemented to facilitate rapid exploration while suggesting an optimal GCN solution with suitable dataflow and compression formats. Our proposed framework can achieve 12.3X, 2.2X, and 1.37X speedup and 15.3X, 3.7X, and 1.6X energy efficiency on average as compared to HyGCN, AWB-GCN, and GCNAX, respectively.