SMM-Conv: Scalar Matrix Multiplication with Zero Packing for Accelerated Convolution
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915032216895488 |
|---|---|
| author | Ofir, Amir Ben-Artzi, Gil |
| author_facet | Ofir, Amir Ben-Artzi, Gil |
| contents | We present a novel approach for accelerating convolutions during inference for CPU-based architectures. The most common method of computation involves packing the image into the columns of a matrix (im2col) and performing general matrix multiplication (GEMM) with a matrix of weights. This results in two main drawbacks: (a) im2col requires a large memory buffer and can experience inefficient memory access, and (b) while GEMM is highly optimized for scientific matrices multiplications, it is not well suited for convolutions. We propose an approach that takes advantage of scalar-matrix multiplication and reduces memory overhead. Our experiments with commonly used network architectures demonstrate a significant speedup compared to existing indirect methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_15659 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | SMM-Conv: Scalar Matrix Multiplication with Zero Packing for Accelerated Convolution Ofir, Amir Ben-Artzi, Gil Computer Vision and Pattern Recognition We present a novel approach for accelerating convolutions during inference for CPU-based architectures. The most common method of computation involves packing the image into the columns of a matrix (im2col) and performing general matrix multiplication (GEMM) with a matrix of weights. This results in two main drawbacks: (a) im2col requires a large memory buffer and can experience inefficient memory access, and (b) while GEMM is highly optimized for scientific matrices multiplications, it is not well suited for convolutions. We propose an approach that takes advantage of scalar-matrix multiplication and reduces memory overhead. Our experiments with commonly used network architectures demonstrate a significant speedup compared to existing indirect methods. |
| title | SMM-Conv: Scalar Matrix Multiplication with Zero Packing for Accelerated Convolution |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2411.15659 |