Peipei Zhouโ€™s Post

View profile for Peipei Zhou, graphic

Tenure-Track Assistant Professor at University of Pittsburgh, ECE Department; CS Ph.D.'19 UCLA

๐Ÿ“ฃ ๐Ÿ“ฃ๐Ÿ“ฃFCCM 2024 Program Highlight Series 07!๐Ÿ“ฃ ๐Ÿ“ฃ๐Ÿ“ฃ ๐Œ๐‘๐‡-๐†๐‚๐: ๐€๐ง ๐„๐Ÿ๐Ÿ๐ข๐œ๐ข๐ž๐ง๐ญ ๐†๐‚๐ ๐€๐œ๐œ๐ž๐ฅ๐ž๐ซ๐š๐ญ๐จ๐ซ ๐Ÿ๐จ๐ซ ๐Œ๐ฎ๐ฅ๐ญ๐ข-๐‘๐ž๐ฅ๐š๐ญ๐ข๐จ๐ง ๐‡๐ž๐ญ๐ž๐ซ๐จ๐ ๐ž๐ง๐ž๐จ๐ฎ๐ฌ ๐†๐ซ๐š๐ฉ๐ก ๐€๐ฎ๐ญ๐ก๐จ๐ซ๐ฌ: Wenlu Peng, Jianjun Chen, Wenjin Huang, Yihua Huang ๐€๐Ÿ๐Ÿ๐ข๐ฅ๐ข๐š๐ญ๐ข๐จ๐ง: Sun Yat-sen University ๐Š๐ž๐ฒ ๐‚๐จ๐ง๐ญ๐ซ๐ข๐›๐ฎ๐ญ๐ข๐จ๐ง๐ฌ: ๐ŸŒŸ Data dimensionality reduction. The proposed MRH-GCN introduced a configurable multiple adjacency matrix fusion strategy designed for HGCNs, aiming to reduce the dimensionality of adjacency matrices. ๐ŸŒŸ Data compression. This paper employed a sparse-matrix-tile space search compression algorithm to maximize the compression of sparse data in the adjacency matrix and feature matrix, reducing data sparsity and improving indexing efficiency. ๐ŸŒŸ Regular array pipeline execution mode. The paper adopted a regular array pipeline designed for the three computation stages of HGCNs, matching memory access and computation time, and reducing on-chip memory pressure. ๐ŸŒŸ Efficient hardware architecture. This paper employed an SpMM systolic array to facilitate the compression algorithm and regular scheduling scheme, achieving massive data parallelism. Also, relation-awareness was introduced in the combination stage to enhance computational efficiency.

To view or add a comment, sign in

Explore topics