SYShiyan Yi

Shiyan Yi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Shiyan Yi has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • GATe: Efficient Graph Attention Network Acceleration With Near-Memory Processing

    by Shiyan Yi, Yudi Qiu, Guohao Xu, Lingfei Lu, Xiaoyang Zeng, Yibo Fan

    Graph Attention Network (GAT) has gained widespread adoption thanks to its exceptional performance in processing non-Euclidean graphs. The critical components of a GAT model involve aggregation and attention, which cause numerous main-memory access, occupying significant inference time. Recently, much research has proposed near-memory processing (NMP) architectures to accelerate aggregation. However, graph attention requires additional operations distinct from aggregation, making previous NMP architectures less suitable for supporting GAT, as they typically target aggregation-only workloads. In this paper, we propose GATe, a practical and efficient GAT accelerator with NMP architecture. To the best of our knowledge, this is the first time that accelerates both attention and aggregation computation on DIMM. We unify feature vector access to eliminate the two repetitive memory accesses to source nodes caused by the sequential phase-by-phase execution of attention and aggregation. Next, we refine the computation flow to reduce data dependencies in concatenation and softmax, which lowers on-chip memory usage and communication overhead. Additionally, we introduce a novel sharding method that enhances data reusability of high-degree nodes. Experiments show that GATe achieves substantial speedup of GAT attention and aggregation phases up to 6.77${\boldsymbol\times}$ and 2.46${\boldsymbol\times}$, with average to 3.69${\boldsymbol\times}$ and 2.24${\boldsymbol\times}$, respectively, compared to state-of-the-art NMP works GNNear and GraNDe.


  • Flips: A Flexible Partitioning Strategy Near Memory Processing Architecture for Recommendation System

    by Yudi Qiu, Lingfei Lu, Shiyan Yi, Minge Jing, Xiaoyang Zeng, Yang Kong, Yibo Fan

    Personalized recommendation systems are massively deployed in production data centers. The memory-intensive embedding layers of recommendation systems are the crucial performance bottleneck, with operations manifesting as sparse memory lookups and simple reduction computations. Recent studies propose near-memory processing (NMP) architectures to speed up embedding operations by utilizing high internal memory bandwidth. However, these solutions typically employ a fixed vector partitioning strategy that fail to adapt to changes in data center deployment scenarios and lack practicality. We propose Flips, a flexible partitioning strategy NMP architecture that accelerates embedding layers. Flips supports more than ten partitioning strategies through hardware-software co-design. Novel hardware architectures and address mapping schemes are designed for the memory-side and host-side. We provide two approaches to determine the optimal partitioning strategy for each embedding table, enabling the architecture to accommodate changes in deployment scenarios. Importantly, Flips is decoupled from the NMP level and can utilize rank-level, bank-group-level and bank-level parallelism. In peer-level NMP evaluations, Flips outperforms state-of-the-art NMP solutions, RecNMP, TRiM, and ReCross by up to 4.0×, 4.1×, and 3.5×, respectively.

  • A High Compression Efficiency Hardware Encoder for Intra and Inter Coding With 4K@30fps Throughput

    by Guohao Xu, Leilei Huang, Zhijian Hao, Wei Li, Shiyan Yi, Xiaoyang Zeng, Yibo Fan

    The promotion of the HEVC standard has significantly alleviated the burden of network transmission and video storage. However, its inherent complexity and data dependencies pose a significant challenge in achieving high compression efficiency hardware encoder. To tackle this challenge, we propose several hardware-oriented algorithms and achieve a hardware encoder supporting both intra and inter coding. In terms of algorithms, our optimizations focus on intra mode decision, motion estimation (ME), rate estimation, and merge mode estimation. These optimizations reduce the computational complexity and address the data dependencies within and between encoder modules while maintaining an acceptable compression efficiency. As for hardware, we propose an encoder architecture that supports not only 35 intra prediction modes but also ME with an extensive search range of [±64, ±64]. The uniform 4×4 engine, 2-D data reuse, and timing schedule for intra and inter coding are presented in this architecture to optimize the hardware resource consumption and throughput. Compared with HM 15.0, the proposed hardware-oriented algorithms lead to a 1.88% and 14.57% increase in BD-Rate under the configurations of all intra and low delay P, respectively. Notably, the BD-Rate outperforms all existing hardware encoders supporting 4K resolution. In a GF 28nm fabrication process, the hardware design achieves a clock frequency of 550MHz, supporting 4K@30fps throughput with a hardware gate count of 3154K and memory usage of 1.02MB, and the proposed architecture demonstrates substantial advantages in terms of area, throughput, and power compared to other studies.


  • GATe: Streamlining Memory Access and Communication to Accelerate Graph Attention Network With Near-Memory Processing

    by Shiyan Yi, Yudi Qiu, Lingfei Lu, Guohao Xu, Yong Gong, Xiaoyang Zeng, Yibo Fan

    Graph Attention Network (GAT) has gained widespread adoption thanks to its exceptional performance. The critical components of a GAT model involve aggregation and attention, which cause numerous main-memory access. Recently, much research has proposed near-memory processing (NMP) architectures to accelerate aggregation. However, graph attention requires additional operations distinct from aggregation, making previous NMP architectures less suitable for supporting GAT. In this paper, we propose GATe, a practical and efficient GAT acc e lerator with NMP architecture. To the best of our knowledge, this is the first time that accelerates both attention and aggregation computation on DIMM. In the attention and aggregation phases, we unify feature vector access to reduce repetitive memory accesses and refine the computation flow to reduce communication. Furthermore, we introduce a novel sharding method that enhances the data reusability. Experiments show that our work achieves substantial speedup of up to 6.77× and 2.46×, respectively, compared to state-of-the-art NMP works GNNear and GraNDe.


  • A Flexible Embedding-Aware Near Memory Processing Architecture for Recommendation System

    by Lingfei Lu, Yudi Qiu, Shiyan Yi, Yibo Fan

    Personalized recommendation system (RS) is widely used in the industrial community and occupies much time in AI computing centers. A critical component of RS is the embedding layer, which consists of sparse embedding lookups and is memory-bounded. Recent works have proposed near-memory processing (NMP) architectures to utilize high inner-memory bandwidth to speed up embedding lookups. These NMP works divide embedding vectors either horizontally or vertically. However, the effectiveness of horizontal or vertical partitioning is hard to guarantee under different memory configurations or embedding vector sizes. To improve this issue, we propose FeaNMP, a f lexible e mbedding- a ware NMP architecture that accelerates the inference phase of RS. We explore different partitioning strategies in detail and design a flexible way to select optimal ones depending on different embedding dimensions and DDR configurations. As a result, compared to the state-of-the-art rank-level NMP work RecNMP, our work achieves up to 11.1× speedup for embedding layers under mix-dimensioned workloads.


  • Open Access

    A deep LSTM‐CNN based on self‐attention mechanism with input data reduction for short‐term load forecasting

    by Shiyan Yi, Haichun Liu, Tao Chen, Jianwen Zhang, Yibo Fan

    Numerous studies on short‐term load forecasting (STLF) have used feature extraction methods to increase the model's accuracy by incorporating multidimensional features containing time, weather and distance information. However, less attention has been paid to the input data size and output dimensions in STLF. To address these two issues, an STLF model is proposed based on output dimensions using only load data. First, the load data's long‐term behavior (trend and seasonality) is extracted through the long short‐term memory network (LSTM), followed by convolution to obtain the load data's non‐stationarity. Then, using the self‐attention mechanism (SAM), the crucial input load information is emphasized in the forecasting process. The calculation example shows that the proposed algorithm outperforms LSTM, LSTM‐based SAM, and CNN‐GRU‐based SAM by more than 10% in eight different buildings, demonstrating its suitability for forecasting with only load data. Additionally, compared to earlier research utilizing two well‐known public data sets, the MAPE is optimized by 2.2% and 5%, respectively. Also, the method has good prediction accuracy for a wide variety of time granularities and load aggregation levels, so it can be applied to various load forecasting scenarios and has good reference significance for load forecasting instrumentation.