.png){kind=icon}
.png){kind=icon}
Return
Evaluating Spatial Accelerator Architectures with Tiled Matrix-Matrix Multiplication
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2021.3104240.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
There is a growing interest in custom spatial accelerators for machine learning applications. These accelerators employ a spatial array of processing elements (PEs) interacting via custom buffer hierarchies and networks-on-chip. The efficiency of these accelerators comes from employing optimized dataflow (i.e., spatial/temporal partitioning of data across the PEs and fine-grained scheduling) strategies to optimize data reuse. The focus of this work is to evaluate these accelerator architectures using a tiled general matrix-matrix multiplication (GEMM) kernel. To do so, we develop a framework that finds optimized mappings (dataflow and tile sizes) for a tiled GEMM for a given spatial accelerator and workload combination, leveraging an analytical cost model for runtime and energy. Our evaluations over five spatial accelerators demonstrate that the tiled GEMM mappings systematically generated by our framework achieve high performance on various GEMM workloads and accelerators.
Keywords:
Kernel
Analytical models
Runtime
Hardware
Shape
Parallel processing
Sparse matrices
Spatial accelerator
DNN accelerator
dataflow
GEMM mapping
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
View more organizations